public class Reduced {
    static boolean e;
    int a;
    long c;
    float fFld;
    byte f;
    int g[];
    long h[][];

    public static void main(String[] args) {
        try {
            Reduced t = new Reduced();
            t.q(args);
        } catch (Exception e) {
        }
    }

    void q(String[] r) {
        int i, s = 61, t, u = 5, v, w = 46, x = 22, y = 12, z = 4;
      for (i = 13; i < 248; ++i) {
        s += i;
      }
        g[30907] *= s++;
        for (t = 10; 42 > t; ) {
            j(e);
            for (v = 4; v < 76; ++v) {
                e = false;
                fFld += v - c;
                for (x = 1; x < 2; ++x) {
                    y += fFld;
                    w <<= g[v - 1] -= (int) fFld;
                }
            }
            for (z = 4; z < 76; z++) {
                f += (byte) (z * z);
              if (e) {
              }
            }
            u *= 9;
            switch (t % 9 + 117) {
                case 118:
                    h[t] = h[1];
                    break;
                case 9:
                    try {
                        s = 309807624;
                    } catch (ArithmeticException ac) {
                    }
                    c += 7;
            }
        }
    }

    void j(boolean b) {
        int l, m = 224, n = 7, o = 148, p[][] = new int[a][];
      for (l = 215; 9 < l; ) {
      }
    }
}