import java.math.BigInteger;

public class Euler48 {

    private static final long MOD = 10000000000L;

    private static class Options {
        int n = 1000;
        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');
        }
        options.n = parsed;
        return true;
    }

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

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

    private static long modPow(long base, int exponent) {
        long result = 1L;
        base %= MOD;

        while (exponent > 0) {
            if ((exponent & 1) != 0) {
                BigInteger res = BigInteger.valueOf(result);
                res = res.multiply(BigInteger.valueOf(base));
                res = res.remainder(BigInteger.valueOf(MOD));
                result = res.longValue();
            }
            BigInteger b = BigInteger.valueOf(base);
            b = b.multiply(b);
            b = b.remainder(BigInteger.valueOf(MOD));
            base = b.longValue();
            exponent >>= 1;
        }

        return result;
    }

    private static long solve(int n) {
        long total = 0L;
        for (int k = 1; k <= n; k++) {
            total = (total + modPow(k, k)) % MOD;
        }
        return total;
    }

    private static boolean runCheckpoints() {
        if (solve(10) != 405071317L) {
            System.err.println("Checkpoint failed for n=10");
            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.n));
    }
}