public class Euler381 {

    static String solve() {
        int limit = 100000000;
        boolean[] isComposite = new boolean[limit];

        int isqrt = (int) Math.sqrt(limit);
        for (int i = 2; i <= isqrt; i++) {
            if (!isComposite[i]) {
                for (int j = i * i; j < limit; j += i) {
                    isComposite[j] = true;
                }
            }
        }

        long total = 0;
        for (int p = 5; p < limit; p++) {
            if (!isComposite[p]) {
                long pl = p;
                long inv8 = ((8L - (pl & 7L)) * pl + 1L) / 8L;
                long s = (pl + pl - ((3L * inv8) % pl)) % pl;
                total += s;
            }
        }

        return Long.toString(total);
    }

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