import java.util.*;

public class Euler77 {
    static boolean isPrime(int n) {
        if (n < 2)
            return false;
        if (n < 4)
            return true;
        if (n % 2 == 0 || n % 3 == 0)
            return false;
        for (int i = 5; i * i <= n; i += 6)
            if (n % i == 0 || n % (i + 2) == 0)
                return false;
        return true;
    }

    public static void main(String[] args) {
        List<Integer> primes = new ArrayList<>();
        for (int n = 2;; n++) {
            if (isPrime(n))
                primes.add(n);
            long[] ways = new long[n + 1];
            ways[0] = 1;
            for (int p : primes) {
                if (p > n)
                    break;
                for (int s = p; s <= n; s++)
                    ways[s] += ways[s - p];
            }
            if (ways[n] > 5000) {
                System.out.println(n);
                return;
            }
        }
    }
}