/*
 * Decompiled with CFR 0.152.
 */
public final class cn {
    private static final cn[] c = new cn[22];
    public final int a;
    public final int b;

    public final String toString() {
        return super.toString();
    }

    public static cn b(int n) {
        if (n >= 1 && n <= 22) {
            return c[n - 1];
        }
        return null;
    }

    static {
        int n = 256;
        for (int i = 1; i <= 22; ++i) {
            cn.c[i - 1] = new cn(i, n);
            n *= 2;
        }
    }

    public final cn b() {
        if (this.b > 7) {
            return cn.b(this.b - 1);
        }
        return cn.b(this.b - 2);
    }

    public final cn a() {
        if (this.b < 7) {
            return cn.b(this.b + 2);
        }
        return cn.b(this.b + 1);
    }

    public final int a(int n, int n2) {
        if (this.b >= n2) {
            return n >> this.b - n2;
        }
        return n << n2 - this.b;
    }

    public final boolean b(cn cn2) {
        return this.b > cn2.b;
    }

    public final int a(cn cn2) {
        return cn2.a / this.a;
    }

    public final int a(int n) {
        return Math.max((int)((long)n * (long)this.a / 40076000L), 1);
    }

    private cn(int n, int n2) {
        this.b = n;
        this.a = n2;
    }
}