import java.util.ArrayList;
import java.util.List;

public class Euler249 {
    public static String solve() {
        int primeLimit = 5000;
        long modulo = 10000000000000000L;

        boolean[] sieve = new boolean[primeLimit];
        for (int i = 2; i < primeLimit; i++)
            sieve[i] = true;

        for (int i = 2; i * i < primeLimit; ++i) {
            if (sieve[i]) {
                for (int j = i * i; j < primeLimit; j += i) {
                    sieve[j] = false;
                }
            }
        }

        List<Integer> primes = new ArrayList<>();
        int maxSum = 0;
        for (int i = 2; i < primeLimit; ++i) {
            if (sieve[i]) {
                primes.add(i);
                maxSum += i;
            }
        }

        long[] ways = new long[maxSum + 1];
        ways[0] = 1;

        int currentSum = 0;
        for (int p : primes) {
            for (int s = currentSum; s >= 0; --s) {
                long add = ways[s];
                if (add == 0)
                    continue;

                int dst = s + p;
                ways[dst] += add;
                if (ways[dst] >= modulo) {
                    ways[dst] -= modulo;
                }
            }
            currentSum += p;
        }

        boolean[] isPrimeSum = new boolean[maxSum + 1];
        for (int i = 2; i <= maxSum; i++)
            isPrimeSum[i] = true;

        for (int i = 2; i * i <= maxSum; ++i) {
            if (isPrimeSum[i]) {
                for (int j = i * i; j <= maxSum; j += i) {
                    isPrimeSum[j] = false;
                }
            }
        }

        long answer = 0;
        for (int s = 2; s <= maxSum; ++s) {
            if (isPrimeSum[s]) {
                answer += ways[s];
                answer %= modulo;
            }
        }

        return String.valueOf(answer);
    }

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