/*
 * Decompiled with CFR 0.152.
 */
public final class oq {
    public static String a = lh.d(72);
    public static String b = lh.d(68);
    public static String c = lh.d(69);
    public static String d = lh.d(71);
    public static String e = lh.d(75);
    public static boolean f;

    private static int a(long l, int n) {
        return (int)(((l << 8) + (long)(n << 7)) / (long)n >> 8);
    }

    private static String a(int n) {
        if (n >= 95) {
            if (n >= 950) {
                if (n > 1000) {
                    String string = Integer.toString(n);
                    n = string.length() - 3;
                    int n2 = Integer.parseInt(string.substring(0, n));
                    n = Integer.parseInt(string.substring(n));
                    if (n2 >= 100 && n >= 500) {
                        n = 0;
                        ++n2;
                    } else if ((n = oq.a((long)n, 100)) == 10) {
                        n = 0;
                        ++n2;
                    }
                    if (n2 <= 100) {
                        return ed.a(c, n2 + e + n);
                    }
                    return ed.a(c, Integer.toString(n2));
                }
                return ed.a(c, "1" + e + "0");
            }
            return ed.a(c, "0" + e + oq.a((long)n, 100));
        }
        return ed.a(d, Integer.toString(n));
    }

    private static String b(int n) {
        long l = (long)n * 32808L;
        if (l >= 5020000L) {
            if (l >= 50160000L) {
                if (l > 52800000L) {
                    long l2 = l / 52800000L;
                    if (l2 >= (long)100 && (l %= 52800000L) >= 26400000L) {
                        l = 0L;
                        ++l2;
                    } else if ((l = (long)oq.a(l, 5280000)) == (long)10) {
                        ++l2;
                        l = 0L;
                    }
                    if (l2 < (long)100) {
                        return ed.a(a, l2 + e + l);
                    }
                    return ed.a(a, Long.toString(l2));
                }
                return ed.a(a, "1" + e + "0");
            }
            return ed.a(a, "0" + e + oq.a(l, 5280000));
        }
        n = (int)l / 10000;
        if (l - (long)(n * 10000) >= (long)5000) {
            ++n;
        }
        return ed.a(b, Integer.toString(n));
    }

    static {
        boolean bl2 = !lh.d(74).equals("imperial");
        f = bl2;
    }

    public static String a(int n, int n2) {
        if (n >= 0) {
            switch (n2) {
                default: {
                    if (!f) {
                        return oq.b(n);
                    }
                    return oq.a(n);
                }
                case 2: {
                    return oq.b(n);
                }
                case 1: 
            }
            return oq.a(n);
        }
        return "";
    }
}