class Euler30 {

    private static class Options {
        int power = 5;
        boolean runCheckpoints = true;
    }

    private static boolean parseIntAfterPrefix(String arg, String prefix, Options options) {
        if (!arg.startsWith(prefix)) {
            return false;
        }
        String tail = arg.substring(prefix.length());
        if (tail.isEmpty()) {
            return false;
        }

        int parsed = 0;
        for (int i = 0; i < tail.length(); i++) {
            char c = tail.charAt(i);
            if (c < '0' || c > '9') {
                return false;
            }
            parsed = parsed * 10 + (c - '0');
        }

        if (prefix.equals("--power=")) {
            options.power = parsed;
        }
        return true;
    }

    private static boolean parseArguments(String[] args, Options options) {
        for (String arg : args) {
            if (arg.equals("--skip-checkpoints")) {
                options.runCheckpoints = false;
                continue;
            }
            if (parseIntAfterPrefix(arg, "--power=", options)) {
                continue;
            }

            System.err.println("Unknown argument: " + arg);
            return false;
        }
        return options.power >= 2;
    }

    private static long intPow(int base, int exp) {
        long result = 1;
        for (int i = 0; i < exp; i++) {
            result *= base;
        }
        return result;
    }

    private static long solve(int power) {
        long[] digitPower = new long[10];
        for (int d = 0; d <= 9; d++) {
            digitPower[d] = intPow(d, power);
        }

        long maxDigitTerm = digitPower[9];

        int digits = 1;
        long pow10 = 1;
        while (pow10 <= (long) digits * maxDigitTerm) {
            digits++;
            pow10 *= 10;
        }

        long upper = (long) (digits - 1) * maxDigitTerm;

        long total = 0;
        for (long n = 2; n <= upper; n++) {
            long x = n;
            long sum = 0;
            while (x > 0) {
                sum += digitPower[(int) (x % 10)];
                x /= 10;
            }
            if (sum == n) {
                total += n;
            }
        }

        return total;
    }

    private static boolean runCheckpoints() {
        if (solve(4) != 19316L) {
            System.err.println("Checkpoint failed for power=4");
            return false;
        }
        return true;
    }

    public static void main(String[] args) {
        Options options = new Options();
        if (!parseArguments(args, options)) {
            System.exit(1);
        }

        if (options.runCheckpoints && !runCheckpoints()) {
            System.exit(2);
        }

        System.out.println(solve(options.power));
    }
}