import java.util.ArrayList;

public class Euler773 {

    static final long MOD = 1000000007L;

    static boolean isPrime(int n) {
        if (n < 2)
            return false;
        if (n % 2 == 0)
            return n == 2;
        for (int d = 3; (long) d * d <= n; d += 2) {
            if (n % d == 0)
                return false;
        }
        return true;
    }

    static int[] firstPrimesEnding7(int k) {
        ArrayList<Integer> out = new ArrayList<>();
        int x = 7;
        while (out.size() < k) {
            if (isPrime(x)) {
                out.add(x);
            }
            x += 10;
        }
        int[] result = new int[out.size()];
        for (int i = 0; i < out.size(); i++) {
            result[i] = out.get(i);
        }
        return result;
    }

    static long modPow(long a, long e) {
        long r = 1;
        long cur = a % MOD;
        while (e > 0) {
            if ((e & 1) == 1) {
                r = (r * cur) % MOD;
            }
            cur = (cur * cur) % MOD;
            e >>= 1;
        }
        return r;
    }

    static long solveK(int k) {
        int[] primes = firstPrimesEnding7(k);

        long pMod = 1;
        long phiMod = 1;
        for (int p : primes) {
            pMod = (pMod * p) % MOD;
            phiMod = (phiMod * (p - 1)) % MOD;
        }

        int[] pattern = { 7, 1, 3, 9 };
        long s = 0;
        long comb = 1;

        for (int t = 0; t <= k; ++t) {
            long term = (comb * pattern[t & 3]) % MOD;
            if ((t & 1) == 0) {
                s = (s + term) % MOD;
            } else {
                s = (s - term + MOD) % MOD;
            }

            if (t < k) {
                long num = k - t;
                long inv = modPow(t + 1, MOD - 2);
                comb = (comb * num) % MOD;
                comb = (comb * inv) % MOD;
            }
        }

        long inner = (5L * phiMod + s) % MOD;
        return (pMod * inner) % MOD;
    }

    public static String solve() {
        return Long.toString(solveK(97));
    }

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