// Decompiled by Jad v1.5.8f. Copyright 2001 Pavel Kouznetsov.
// Jad home page: http://www.kpdus.com/jad.html
// Decompiler options: packimports(3) 

import sign.signlink;

public class Class16
{

    public static void method216(Class11 class11)
    {
        Class31_Sub3_Sub2 class31_sub3_sub2 = new Class31_Sub3_Sub2((byte)114, class11.method204("fragmentsenc.txt", null));
        Class31_Sub3_Sub2 class31_sub3_sub2_1 = new Class31_Sub3_Sub2((byte)114, class11.method204("badenc.txt", null));
        Class31_Sub3_Sub2 class31_sub3_sub2_2 = new Class31_Sub3_Sub2((byte)114, class11.method204("domainenc.txt", null));
        Class31_Sub3_Sub2 class31_sub3_sub2_3 = new Class31_Sub3_Sub2((byte)114, class11.method204("tldlist.txt", null));
        method217(class31_sub3_sub2, class31_sub3_sub2_1, class31_sub3_sub2_2, class31_sub3_sub2_3);
    }

    public static void method217(Class31_Sub3_Sub2 class31_sub3_sub2, Class31_Sub3_Sub2 class31_sub3_sub2_1, Class31_Sub3_Sub2 class31_sub3_sub2_2, Class31_Sub3_Sub2 class31_sub3_sub2_3)
    {
        method219(class31_sub3_sub2_1, -17);
        method220(class31_sub3_sub2_2, true);
        method221(94, class31_sub3_sub2);
        method218(-927, class31_sub3_sub2_3);
    }

    public static void method218(int i, Class31_Sub3_Sub2 class31_sub3_sub2)
    {
        if(i >= 0)
            return;
        int j = class31_sub3_sub2.method427();
        aCharArrayArray259 = new char[j][];
        anIntArray260 = new int[j];
        for(int k = 0; k < j; k++)
        {
            anIntArray260[k] = class31_sub3_sub2.method422();
            char ac[] = new char[class31_sub3_sub2.method422()];
            for(int l = 0; l < ac.length; l++)
                ac[l] = (char)class31_sub3_sub2.method422();

            aCharArrayArray259[k] = ac;
        }

    }

    public static void method219(Class31_Sub3_Sub2 class31_sub3_sub2, int i)
    {
        int j = class31_sub3_sub2.method427();
        aCharArrayArray256 = new char[j][];
        aByteArrayArrayArray257 = new byte[j][][];
        method222(aByteArrayArrayArray257, 136, aCharArrayArray256, class31_sub3_sub2);
        if(i >= 0)
            aBoolean253 = !aBoolean253;
    }

    public static void method220(Class31_Sub3_Sub2 class31_sub3_sub2, boolean flag)
    {
        int i = class31_sub3_sub2.method427();
        if(!flag)
            aBoolean253 = !aBoolean253;
        aCharArrayArray258 = new char[i][];
        method223(class31_sub3_sub2, -115, aCharArrayArray258);
    }

    public static void method221(int i, Class31_Sub3_Sub2 class31_sub3_sub2)
    {
        anIntArray255 = new int[class31_sub3_sub2.method427()];
        for(int j = 0; j < anIntArray255.length; j++)
            anIntArray255[j] = class31_sub3_sub2.method424();

        if(i <= 0)
        {
            for(int k = 1; k > 0; k++);
        }
    }

    public static void method222(byte abyte0[][][], int i, char ac[][], Class31_Sub3_Sub2 class31_sub3_sub2)
    {
        for(int j = 0; j < ac.length; j++)
        {
            char ac1[] = new char[class31_sub3_sub2.method422()];
            for(int k = 0; k < ac1.length; k++)
                ac1[k] = (char)class31_sub3_sub2.method422();

            ac[j] = ac1;
            byte abyte1[][] = new byte[class31_sub3_sub2.method422()][2];
            for(int l = 0; l < abyte1.length; l++)
            {
                abyte1[l][0] = (byte)class31_sub3_sub2.method422();
                abyte1[l][1] = (byte)class31_sub3_sub2.method422();
            }

            if(abyte1.length > 0)
                abyte0[j] = abyte1;
        }

        i = 31 / i;
    }

    public static void method223(Class31_Sub3_Sub2 class31_sub3_sub2, int i, char ac[][])
    {
        for(int j = 0; j < ac.length; j++)
        {
            char ac1[] = new char[class31_sub3_sub2.method422()];
            for(int k = 0; k < ac1.length; k++)
                ac1[k] = (char)class31_sub3_sub2.method422();

            ac[j] = ac1;
        }

        if(i < 0);
    }

    public static void method224(char ac[], int i)
    {
        int j = 0;
        i = 35 / i;
        for(int k = 0; k < ac.length; k++)
        {
            if(method225(3, ac[k]))
                ac[j] = ac[k];
            else
                ac[j] = ' ';
            if(j == 0 || ac[j] != ' ' || ac[j - 1] != ' ')
                j++;
        }

        for(int l = j; l < ac.length; l++)
            ac[l] = ' ';

    }

    public static boolean method225(int i, char c)
    {
        if(i < 3 || i > 3)
            throw new NullPointerException();
        return c >= ' ' && c <= '\177' || c == ' ' || c == '\n' || c == '\t' || c == '\243' || c == '\u20AC';
    }

    public static String method226(String s, int i)
    {
        long l = System.currentTimeMillis();
        char ac[] = s.toCharArray();
        method224(ac, 824);
        String s1 = (new String(ac)).trim();
        ac = s1.toLowerCase().toCharArray();
        String s2 = s1.toLowerCase();
        method234(false, ac);
        method229(0, ac);
        method230(0, ac);
        method243(ac, (byte)5);
        for(int j = 0; j < aStringArray261.length; j++)
        {
            for(int k = -1; (k = s2.indexOf(aStringArray261[j], k + 1)) != -1;)
            {
                char ac1[] = aStringArray261[j].toCharArray();
                for(int i1 = 0; i1 < ac1.length; i1++)
                    ac[i1 + k] = ac1[i1];

            }

        }

        if(i != 0)
            anInt245 = 431;
        method227(ac, s1.toCharArray(), -15);
        method228(-28516, ac);
        long l1 = System.currentTimeMillis();
        return (new String(ac)).trim();
    }

    public static void method227(char ac[], char ac1[], int i)
    {
        for(int j = 0; j < ac1.length; j++)
            if(ac[j] != '*' && method251(ac1[j], true))
                ac[j] = ac1[j];

        while(i >= 0) 
            return;
    }

    public static void method228(int i, char ac[])
    {
        if(i != -28516)
            aBoolean253 = !aBoolean253;
        boolean flag = true;
        for(int j = 0; j < ac.length; j++)
        {
            char c = ac[j];
            if(method248(0, c))
            {
                if(flag)
                {
                    if(method250(c, 0))
                        flag = false;
                } else
                if(method251(c, true))
                    ac[j] = (char)((c + 97) - 65);
            } else
            {
                flag = true;
            }
        }

    }

    public static void method229(int i, char ac[])
    {
        if(i != 0)
            return;
        for(int j = 0; j < 2; j++)
        {
            for(int k = aCharArrayArray256.length - 1; k >= 0; k--)
                method238(aByteArrayArrayArray257[k], ac, aCharArrayArray256[k], 0);

        }

    }

    public static void method230(int i, char ac[])
    {
        char ac1[] = (char[])ac.clone();
        char ac2[] = {
            '(', 'a', ')'
        };
        method238(null, ac1, ac2, 0);
        char ac3[] = (char[])ac.clone();
        char ac4[] = {
            'd', 'o', 't'
        };
        method238(null, ac3, ac4, 0);
        if(i != 0)
            aBoolean253 = !aBoolean253;
        for(int j = aCharArrayArray258.length - 1; j >= 0; j--)
            method231(ac1, 81, ac, ac3, aCharArrayArray258[j]);

    }

    public static void method231(char ac[], int i, char ac1[], char ac2[], char ac3[])
    {
        if(ac3.length > ac1.length)
            return;
        boolean flag = true;
        if(i <= 0)
            return;
        int j;
        for(int k = 0; k <= ac1.length - ac3.length; k += j)
        {
            int l = k;
            int i1 = 0;
            j = 1;
            while(l < ac1.length) 
            {
                int j1 = 0;
                char c = ac1[l];
                char c1 = '\0';
                if(l + 1 < ac1.length)
                    c1 = ac1[l + 1];
                if(i1 < ac3.length && (j1 = method240(c, ac3[i1], anInt247, c1)) > 0)
                {
                    l += j1;
                    i1++;
                    continue;
                }
                if(i1 == 0)
                    break;
                if((j1 = method240(c, ac3[i1 - 1], anInt247, c1)) > 0)
                {
                    l += j1;
                    if(i1 == 1)
                        j++;
                    continue;
                }
                if(i1 >= ac3.length || !method246(694, c))
                    break;
                l++;
            }
            if(i1 >= ac3.length)
            {
                boolean flag1 = false;
                int k1 = method232(0, ac, ac1, k);
                int l1 = method233(l - 1, ac1, false, ac2);
                if(k1 > 2 || l1 > 2)
                    flag1 = true;
                if(flag1)
                {
                    for(int i2 = k; i2 < l; i2++)
                        ac1[i2] = '*';

                }
            }
        }

    }

    public static int method232(int i, char ac[], char ac1[], int j)
    {
        if(i != 0)
            return anInt247;
        if(j == 0)
            return 2;
        for(int k = j - 1; k >= 0; k--)
        {
            if(!method246(694, ac1[k]))
                break;
            if(ac1[k] == '@')
                return 3;
        }

        int l = 0;
        for(int i1 = j - 1; i1 >= 0; i1--)
        {
            if(!method246(694, ac[i1]))
                break;
            if(ac[i1] == '*')
                l++;
        }

        if(l >= 3)
            return 4;
        return !method246(694, ac1[j - 1]) ? 0 : 1;
    }

    public static int method233(int i, char ac[], boolean flag, char ac1[])
    {
        if(i + 1 == ac.length)
            return 2;
        for(int j = i + 1; j < ac.length; j++)
        {
            if(!method246(694, ac[j]))
                break;
            if(ac[j] == '.' || ac[j] == ',')
                return 3;
        }

        int k = 0;
        for(int l = i + 1; l < ac.length; l++)
        {
            if(!method246(694, ac1[l]))
                break;
            if(ac1[l] == '*')
                k++;
        }

        if(flag)
            anInt254 = -341;
        if(k >= 3)
            return 4;
        return !method246(694, ac[i + 1]) ? 0 : 1;
    }

    public static void method234(boolean flag, char ac[])
    {
        char ac1[] = (char[])ac.clone();
        char ac2[] = {
            'd', 'o', 't'
        };
        method238(null, ac1, ac2, 0);
        char ac3[] = (char[])ac.clone();
        char ac4[] = {
            's', 'l', 'a', 's', 'h'
        };
        method238(null, ac3, ac4, 0);
        for(int i = 0; i < aCharArrayArray259.length; i++)
            method235(anIntArray260[i], ac1, ac, ac3, true, aCharArrayArray259[i]);

        if(flag)
        {
            for(int j = 1; j > 0; j++);
        }
    }

    public static void method235(int i, char ac[], char ac1[], char ac2[], boolean flag, char ac3[])
    {
        if(!flag)
            aBoolean253 = !aBoolean253;
        if(ac3.length > ac1.length)
            return;
        boolean flag1 = true;
        int j;
        for(int k = 0; k <= ac1.length - ac3.length; k += j)
        {
            int l = k;
            int i1 = 0;
            j = 1;
            while(l < ac1.length) 
            {
                int j1 = 0;
                char c = ac1[l];
                char c1 = '\0';
                if(l + 1 < ac1.length)
                    c1 = ac1[l + 1];
                if(i1 < ac3.length && (j1 = method240(c, ac3[i1], anInt247, c1)) > 0)
                {
                    l += j1;
                    i1++;
                    continue;
                }
                if(i1 == 0)
                    break;
                if((j1 = method240(c, ac3[i1 - 1], anInt247, c1)) > 0)
                {
                    l += j1;
                    if(i1 == 1)
                        j++;
                    continue;
                }
                if(i1 >= ac3.length || !method246(694, c))
                    break;
                l++;
            }
            if(i1 >= ac3.length)
            {
                boolean flag2 = false;
                int k1 = method236(0, ac1, k, ac);
                int l1 = method237(ac1, l - 1, true, ac2);
                if(i == 1 && k1 > 0 && l1 > 0)
                    flag2 = true;
                if(i == 2 && (k1 > 2 && l1 > 0 || k1 > 0 && l1 > 2))
                    flag2 = true;
                if(i == 3 && k1 > 0 && l1 > 2)
                    flag2 = true;
                boolean _tmp = i == 3 && k1 > 2 && l1 > 0;
                if(flag2)
                {
                    int i2 = k;
                    int j2 = l - 1;
                    if(k1 > 2)
                    {
                        if(k1 == 4)
                        {
                            boolean flag3 = false;
                            for(int l2 = i2 - 1; l2 >= 0; l2--)
                                if(flag3)
                                {
                                    if(ac[l2] != '*')
                                        break;
                                    i2 = l2;
                                } else
                                if(ac[l2] == '*')
                                {
                                    i2 = l2;
                                    flag3 = true;
                                }

                        }
                        boolean flag4 = false;
                        for(int i3 = i2 - 1; i3 >= 0; i3--)
                            if(flag4)
                            {
                                if(method246(694, ac1[i3]))
                                    break;
                                i2 = i3;
                            } else
                            if(!method246(694, ac1[i3]))
                            {
                                flag4 = true;
                                i2 = i3;
                            }

                    }
                    if(l1 > 2)
                    {
                        if(l1 == 4)
                        {
                            boolean flag5 = false;
                            for(int j3 = j2 + 1; j3 < ac1.length; j3++)
                                if(flag5)
                                {
                                    if(ac2[j3] != '*')
                                        break;
                                    j2 = j3;
                                } else
                                if(ac2[j3] == '*')
                                {
                                    j2 = j3;
                                    flag5 = true;
                                }

                        }
                        boolean flag6 = false;
                        for(int k3 = j2 + 1; k3 < ac1.length; k3++)
                            if(flag6)
                            {
                                if(method246(694, ac1[k3]))
                                    break;
                                j2 = k3;
                            } else
                            if(!method246(694, ac1[k3]))
                            {
                                flag6 = true;
                                j2 = k3;
                            }

                    }
                    for(int k2 = i2; k2 <= j2; k2++)
                        ac1[k2] = '*';

                }
            }
        }

    }

    public static int method236(int i, char ac[], int j, char ac1[])
    {
        if(j == 0)
            return 2;
        for(int k = j - 1; k >= 0; k--)
        {
            if(!method246(694, ac[k]))
                break;
            if(ac[k] == ',' || ac[k] == '.')
                return 3;
        }

        if(i != 0)
        {
            for(int l = 1; l > 0; l++);
        }
        int i1 = 0;
        for(int j1 = j - 1; j1 >= 0; j1--)
        {
            if(!method246(694, ac1[j1]))
                break;
            if(ac1[j1] == '*')
                i1++;
        }

        if(i1 >= 3)
            return 4;
        return !method246(694, ac[j - 1]) ? 0 : 1;
    }

    public static int method237(char ac[], int i, boolean flag, char ac1[])
    {
        if(!flag)
            return 0;
        if(i + 1 == ac.length)
            return 2;
        for(int j = i + 1; j < ac.length; j++)
        {
            if(!method246(694, ac[j]))
                break;
            if(ac[j] == '\\' || ac[j] == '/')
                return 3;
        }

        int k = 0;
        for(int l = i + 1; l < ac.length; l++)
        {
            if(!method246(694, ac1[l]))
                break;
            if(ac1[l] == '*')
                k++;
        }

        if(k >= 5)
            return 4;
        return !method246(694, ac[i + 1]) ? 0 : 1;
    }

    public static void method238(byte abyte0[][], char ac[], char ac1[], int i)
    {
        if(ac1.length > ac.length)
            return;
        boolean flag = true;
        if(i != 0)
            return;
        int j;
        for(int k = 0; k <= ac.length - ac1.length; k += j)
        {
            int l = k;
            int i1 = 0;
            int j1 = 0;
            j = 1;
            boolean flag1 = false;
            boolean flag2 = false;
            boolean flag3 = false;
            while(l < ac.length && (!flag2 || !flag3)) 
            {
                int k1 = 0;
                char c = ac[l];
                char c2 = '\0';
                if(l + 1 < ac.length)
                    c2 = ac[l + 1];
                if(i1 < ac1.length && (k1 = method241(c2, c, anInt248, ac1[i1])) > 0)
                {
                    if(k1 == 1 && method249(662, c))
                        flag2 = true;
                    if(k1 == 2 && (method249(662, c) || method249(662, c2)))
                        flag2 = true;
                    l += k1;
                    i1++;
                    continue;
                }
                if(i1 == 0)
                    break;
                if((k1 = method241(c2, c, anInt248, ac1[i1 - 1])) > 0)
                {
                    l += k1;
                    if(i1 == 1)
                        j++;
                    continue;
                }
                if(i1 >= ac1.length || !method247(c, 3))
                    break;
                if(method246(694, c) && c != '\'')
                    flag1 = true;
                if(method249(662, c))
                    flag3 = true;
                l++;
                if((++j1 * 100) / (l - k) > 90)
                    break;
            }
            if(i1 >= ac1.length && (!flag2 || !flag3))
            {
                boolean flag4 = true;
                if(!flag1)
                {
                    char c1 = ' ';
                    if(k - 1 >= 0)
                        c1 = ac[k - 1];
                    char c3 = ' ';
                    if(l < ac.length)
                        c3 = ac[l];
                    byte byte0 = method242(-949, c1);
                    byte byte1 = method242(-949, c3);
                    if(abyte0 != null && method239(0, byte1, abyte0, byte0))
                        flag4 = false;
                } else
                {
                    boolean flag5 = false;
                    boolean flag6 = false;
                    if(k - 1 < 0 || method246(694, ac[k - 1]) && ac[k - 1] != '\'')
                        flag5 = true;
                    if(l >= ac.length || method246(694, ac[l]) && ac[l] != '\'')
                        flag6 = true;
                    if(!flag5 || !flag6)
                    {
                        boolean flag7 = false;
                        int k2 = k - 2;
                        if(flag5)
                            k2 = k;
                        for(; !flag7 && k2 < l; k2++)
                            if(k2 >= 0 && (!method246(694, ac[k2]) || ac[k2] == '\''))
                            {
                                char ac2[] = new char[3];
                                int j3;
                                for(j3 = 0; j3 < 3; j3++)
                                {
                                    if(k2 + j3 >= ac.length || method246(694, ac[k2 + j3]) && ac[k2 + j3] != '\'')
                                        break;
                                    ac2[j3] = ac[k2 + j3];
                                }

                                boolean flag8 = true;
                                if(j3 == 0)
                                    flag8 = false;
                                if(j3 < 3 && k2 - 1 >= 0 && (!method246(694, ac[k2 - 1]) || ac[k2 - 1] == '\''))
                                    flag8 = false;
                                if(flag8 && !method252(7, ac2))
                                    flag7 = true;
                            }

                        if(!flag7)
                            flag4 = false;
                    }
                }
                if(flag4)
                {
                    int l1 = 0;
                    int i2 = 0;
                    int j2 = -1;
                    for(int l2 = k; l2 < l; l2++)
                        if(method249(662, ac[l2]))
                            l1++;
                        else
                        if(method248(0, ac[l2]))
                        {
                            i2++;
                            j2 = l2;
                        }

                    if(j2 > -1)
                        l1 -= l - 1 - j2;
                    if(l1 <= i2)
                    {
                        for(int i3 = k; i3 < l; i3++)
                            ac[i3] = '*';

                    } else
                    {
                        j = 1;
                    }
                }
            }
        }

    }

    public static boolean method239(int i, byte byte0, byte abyte0[][], byte byte1)
    {
        if(i != 0)
            anInt247 = -286;
        int j = 0;
        if(abyte0[j][0] == byte1 && abyte0[j][1] == byte0)
            return true;
        int k = abyte0.length - 1;
        if(abyte0[k][0] == byte1 && abyte0[k][1] == byte0)
            return true;
        do
        {
            int l = (j + k) / 2;
            if(abyte0[l][0] == byte1 && abyte0[l][1] == byte0)
                return true;
            if(byte1 < abyte0[l][0] || byte1 == abyte0[l][0] && byte0 < abyte0[l][1])
                k = l;
            else
                j = l;
        } while(j != k && j + 1 != k);
        return false;
    }

    public static int method240(char c, char c1, int i, char c2)
    {
        if(i >= 0)
            anInt246 = -192;
        if(c1 == c)
            return 1;
        if(c1 == 'o' && c == '0')
            return 1;
        if(c1 == 'o' && c == '(' && c2 == ')')
            return 2;
        if(c1 == 'c' && (c == '(' || c == '<' || c == '['))
            return 1;
        if(c1 == 'e' && c == '\u20AC')
            return 1;
        if(c1 == 's' && c == '$')
            return 1;
        return c1 != 'l' || c != 'i' ? 0 : 1;
    }

    public static int method241(char c, char c1, int i, char c2)
    {
        if(i != 13881)
            return anInt244;
        if(c2 == c1)
            return 1;
        if(c2 >= 'a' && c2 <= 'm')
        {
            if(c2 == 'a')
            {
                if(c1 == '4' || c1 == '@' || c1 == '^')
                    return 1;
                return c1 != '/' || c != '\\' ? 0 : 2;
            }
            if(c2 == 'b')
            {
                if(c1 == '6' || c1 == '8')
                    return 1;
                return (c1 != '1' || c != '3') && (c1 != 'i' || c != '3') ? 0 : 2;
            }
            if(c2 == 'c')
                return c1 != '(' && c1 != '<' && c1 != '{' && c1 != '[' ? 0 : 1;
            if(c2 == 'd')
                return (c1 != '[' || c != ')') && (c1 != 'i' || c != ')') ? 0 : 2;
            if(c2 == 'e')
                return c1 != '3' && c1 != '\u20AC' ? 0 : 1;
            if(c2 == 'f')
            {
                if(c1 == 'p' && c == 'h')
                    return 2;
                return c1 != '\243' ? 0 : 1;
            }
            if(c2 == 'g')
                return c1 != '9' && c1 != '6' && c1 != 'q' ? 0 : 1;
            if(c2 == 'h')
                return c1 != '#' ? 0 : 1;
            if(c2 == 'i')
                return c1 != 'y' && c1 != 'l' && c1 != 'j' && c1 != '1' && c1 != '!' && c1 != ':' && c1 != ';' && c1 != '|' ? 0 : 1;
            if(c2 == 'j')
                return 0;
            if(c2 == 'k')
                return 0;
            if(c2 == 'l')
                return c1 != '1' && c1 != '|' && c1 != 'i' ? 0 : 1;
            if(c2 == 'm')
                return 0;
        }
        if(c2 >= 'n' && c2 <= 'z')
        {
            if(c2 == 'n')
                return 0;
            if(c2 == 'o')
            {
                if(c1 == '0' || c1 == '*')
                    return 1;
                return (c1 != '(' || c != ')') && (c1 != '[' || c != ']') && (c1 != '{' || c != '}') && (c1 != '<' || c != '>') ? 0 : 2;
            }
            if(c2 == 'p')
                return 0;
            if(c2 == 'q')
                return 0;
            if(c2 == 'r')
                return 0;
            if(c2 == 's')
                return c1 != '5' && c1 != 'z' && c1 != '$' && c1 != '2' ? 0 : 1;
            if(c2 == 't')
                return c1 != '7' && c1 != '+' ? 0 : 1;
            if(c2 == 'u')
            {
                if(c1 == 'v')
                    return 1;
                return (c1 != '\\' || c != '/') && (c1 != '\\' || c != '|') && (c1 != '|' || c != '/') ? 0 : 2;
            }
            if(c2 == 'v')
                return (c1 != '\\' || c != '/') && (c1 != '\\' || c != '|') && (c1 != '|' || c != '/') ? 0 : 2;
            if(c2 == 'w')
                return c1 != 'v' || c != 'v' ? 0 : 2;
            if(c2 == 'x')
                return (c1 != ')' || c != '(') && (c1 != '}' || c != '{') && (c1 != ']' || c != '[') && (c1 != '>' || c != '<') ? 0 : 2;
            if(c2 == 'y')
                return 0;
            if(c2 == 'z')
                return 0;
        }
        if(c2 >= '0' && c2 <= '9')
        {
            if(c2 == '0')
            {
                if(c1 == 'o' || c1 == 'O')
                    return 1;
                return (c1 != '(' || c != ')') && (c1 != '{' || c != '}') && (c1 != '[' || c != ']') ? 0 : 2;
            }
            if(c2 == '1')
                return c1 != 'l' ? 0 : 1;
            else
                return 0;
        }
        if(c2 == ',')
            return c1 != '.' ? 0 : 1;
        if(c2 == '.')
            return c1 != ',' ? 0 : 1;
        if(c2 == '!')
            return c1 != 'i' ? 0 : 1;
        else
            return 0;
    }

    public static byte method242(int i, char c)
    {
        if(i >= 0)
            aBoolean253 = !aBoolean253;
        if(c >= 'a' && c <= 'z')
            return (byte)((c - 97) + 1);
        if(c == '\'')
            return 28;
        if(c >= '0' && c <= '9')
            return (byte)((c - 48) + 29);
        else
            return 27;
    }

    public static void method243(char ac[], byte byte0)
    {
        if(byte0 != 5)
            anInt254 = 7;
        int i = 0;
        int j = 0;
        int k = 0;
        int l = 0;
        while((i = method244(ac, j, -29646)) != -1) 
        {
            boolean flag = false;
            for(int i1 = j; i1 >= 0 && i1 < i && !flag; i1++)
                if(!method246(694, ac[i1]) && !method247(ac[i1], 3))
                    flag = true;

            if(flag)
                k = 0;
            if(k == 0)
                l = i;
            j = method245(9, ac, i);
            int j1 = 0;
            for(int k1 = i; k1 < j; k1++)
                j1 = (j1 * 10 + ac[k1]) - 48;

            if(j1 > 255 || j - i > 8)
                k = 0;
            else
                k++;
            if(k == 4)
            {
                for(int l1 = l; l1 < j; l1++)
                    ac[l1] = '*';

                k = 0;
            }
        }
    }

    public static int method244(char ac[], int i, int j)
    {
        if(j != -29646)
        {
            for(int k = 1; k > 0; k++);
        }
        for(int l = i; l < ac.length && l >= 0; l++)
            if(ac[l] >= '0' && ac[l] <= '9')
                return l;

        return -1;
    }

    public static int method245(int i, char ac[], int j)
    {
        for(int k = j; k < ac.length && k >= 0; k++)
            if(ac[k] < '0' || ac[k] > '9')
                return k;

        if(i != 9)
            aBoolean243 = !aBoolean243;
        return ac.length;
    }

    public static boolean method246(int i, char c)
    {
        i = 84 / i;
        return !method248(0, c) && !method249(662, c);
    }

    public static boolean method247(char c, int i)
    {
        if(i < anInt250 || i > anInt250)
            anInt244 = 396;
        if(c < 'a' || c > 'z')
            return true;
        return c == 'v' || c == 'x' || c == 'j' || c == 'q' || c == 'z';
    }

    public static boolean method248(int i, char c)
    {
        if(i != 0)
            aBoolean243 = !aBoolean243;
        return c >= 'a' && c <= 'z' || c >= 'A' && c <= 'Z';
    }

    public static boolean method249(int i, char c)
    {
        if(i <= 0)
            aBoolean243 = !aBoolean243;
        return c >= '0' && c <= '9';
    }

    public static boolean method250(char c, int i)
    {
        if(i != 0)
            throw new NullPointerException();
        return c >= 'a' && c <= 'z';
    }

    public static boolean method251(char c, boolean flag)
    {
        if(!flag)
            aBoolean253 = !aBoolean253;
        return c >= 'A' && c <= 'Z';
    }

    public static boolean method252(int i, char ac[])
    {
        boolean flag = true;
        for(int j = 0; j < ac.length; j++)
            if(!method249(662, ac[j]) && ac[j] != 0)
                flag = false;

        if(flag)
            return true;
        int k = method253(ac, 9);
        int l = 0;
        if(i != 7)
        {
            for(int i1 = 1; i1 > 0; i1++);
        }
        int j1 = anIntArray255.length - 1;
        if(k == anIntArray255[l] || k == anIntArray255[j1])
            return true;
        do
        {
            int k1 = (l + j1) / 2;
            if(k == anIntArray255[k1])
                return true;
            if(k < anIntArray255[k1])
                j1 = k1;
            else
                l = k1;
        } while(l != j1 && l + 1 != j1);
        return false;
    }

    public static int method253(char ac[], int i)
    {
        if(ac.length > 6)
            return 0;
        int j = 0;
        for(int k = 0; k < ac.length; k++)
        {
            char c = ac[ac.length - k - 1];
            if(c >= 'a' && c <= 'z')
                j = j * 38 + ((c - 97) + 1);
            else
            if(c == '\'')
                j = j * 38 + 27;
            else
            if(c >= '0' && c <= '9')
                j = j * 38 + ((c - 48) + 28);
            else
            if(c != 0)
                return 0;
        }

        if(i != anInt252)
            anInt244 = 392;
        return j;
    }

    public static boolean aBoolean243;
    public static int anInt244 = 61;
    public static int anInt245;
    public static int anInt246 = 148;
    public static int anInt247 = -312;
    public static int anInt248 = 13881;
    public static int anInt249 = -949;
    public static int anInt250 = 3;
    public static int anInt251 = 662;
    public static int anInt252 = 9;
    public static boolean aBoolean253;
    public static int anInt254 = 105;
    public static int anIntArray255[];
    public static char aCharArrayArray256[][];
    public static byte aByteArrayArrayArray257[][][];
    public static char aCharArrayArray258[][];
    public static char aCharArrayArray259[][];
    public static int anIntArray260[];
    public static final String aStringArray261[] = {
        "cook", "cook's", "cooks", "seeks", "sheet", "woop", "woops", "faq", "noob", "noobs"
    };
    public static boolean aBoolean262;

}
