import java.io.*; import java.util.*; public class Main_yukicoder458 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); Prime prime = new Prime(n); List primes = prime.getPrimeList(); int[] dp = new int[n + 1]; Arrays.fill(dp, -1); dp[0] = 0; for (int p : primes) { for (int i = n - p; i >= 0; i--) { if (dp[i] >= 0) { dp[i + p] = Math.max(dp[i + p], dp[i] + 1); } } } pr.println(dp[n]); } @SuppressWarnings("unused") private static class Prime { private int n; private List primes; private BitSet p; Prime(int n) { this.n = n; p = new BitSet(n / 2); int m = (int)Math.sqrt(n); // for (int i = 1; i <= m; i++) { for (int bi = p.nextClearBit(0); 2 * (bi + 1) + 1 <= m; bi = p.nextClearBit(bi + 1)) { long i = bi + 1; // if (p.get(i - 1)) { // continue; // } for (long j = 2 * i * (i + 1); 2 * j + 1 <= n; j += 2 * i + 1) { p.set((int)(j - 1)); } } } boolean isPrime(int n) { if (n == 2) { return true; } if (n == 1 || (n & 0x1) == 0) { return false; } return !p.get(n / 2 - 1); } List getPrimeList() { if (primes != null) { return primes; } primes = new ArrayList<>(); if (n >= 2) { primes.add(2); // for (int i = 1; 2 * i + 1 <= n; i++) { for (int bi = p.nextClearBit(0); 2 * (bi + 1) + 1 <= n; bi = p.nextClearBit(bi + 1)) { int i = bi + 1; // if (!p.get(i - 1)) { // primes.add(2 * i + 1); // } primes.add(2 * i + 1); } } return primes; } private static boolean isPrime(long n) { if (n == 2) { return true; } if (n == 1 || (n & 0x1) == 0) { return false; } for (long i = 3; i * i <= n; i += 2) { if (n % i == 0) { return false; } } return true; } } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }