public class Euler571 {
    public static String solve() {
        int k = 10;
        long[] hits = new long[0];
        int count = 0;
        long start = factorial(11);
        long end = factorial(12);
        long[] results = new long[k];
        int found = 0;
        for (long i = start; i < end && found < k; i++) {
            int[] perm = kthPerm12(i);
            if (perm[0] == 0)
                continue;
            long v = toBase12(perm);
            if (isSuper(v, 12))
                results[found++] = v;
        }
        java.util.Arrays.sort(results, 0, found);
        long sum = 0;
        for (int i = 0; i < Math.min(k, found); i++)
            sum += results[i];
        return String.valueOf(sum);
    }

    static boolean isPandigital(long x, int base) {
        int mask = 0, target = (1 << base) - 1;
        while (x > 0) {
            mask |= 1 << (int) (x % base);
            x /= base;
            if (mask == target)
                return true;
        }
        return mask == target;
    }

    static boolean isSuper(long x, int n) {
        for (int b = n - 1; b >= 2; b--)
            if (!isPandigital(x, b))
                return false;
        return true;
    }

    static long factorial(int n) {
        long f = 1;
        for (int i = 2; i <= n; i++)
            f *= i;
        return f;
    }

    static int[] kthPerm12(long k) {
        long[] FACT = new long[13];
        FACT[0] = 1;
        for (int i = 1; i <= 12; i++)
            FACT[i] = FACT[i - 1] * i;
        java.util.List<Integer> avail = new java.util.ArrayList<>();
        for (int i = 0; i < 12; i++)
            avail.add(i);
        int[] perm = new int[12];
        for (int pos = 0; pos < 12; pos++) {
            long f = FACT[11 - pos];
            int idx = (int) (k / f);
            k %= f;
            perm[pos] = avail.remove(idx);
        }
        return perm;
    }

    static long toBase12(int[] perm) {
        long v = 0;
        for (int d : perm)
            v = v * 12 + d;
        return v;
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}