#include <bits/stdc++.h>

using namespace std;

class SieveOfEratosthenes {
 private:
  std::vector<int> sieve;

 public:
  SieveOfEratosthenes(int n) : sieve(n + 1) {
    std::iota(sieve.begin(), sieve.end(), 0);
    for (int i = 2; i * i < n + 1; i++) {
      if (sieve[i] != i) continue;
      for (int j = i * i; j < n + 1; j += i) {
        if (sieve[j] == j) sieve[j] = i;
      }
    }
  }

  bool is_prime(int x) const { return x != 0 && x != 1 && sieve[x] == x; }

  std::vector<int> factor(int x) const {
    std::vector<int> res;
    while (x > 1) {
      res.emplace_back(sieve[x]);
      x /= sieve[x];
    }
    return res;
  }
};

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin >> N;
  SieveOfEratosthenes soe(N);
  vector<int> primes;
  for (int i = 0; i < N + 1; i++) {
    if (soe.is_prime(i)) primes.emplace_back(i);
  }
  vector<vector<int>> dp(primes.size() + 1, vector<int>(N + 1, 0));
  dp[0][0] = 1;
  for (int i = 0; i < (int)primes.size(); i++) {
    for (int j = 0; j < N + 1; j++) {
      dp[i + 1][j] = max(dp[i + 1][j], dp[i][j]);
      if (j + primes[i] <= N && dp[i][j] > 0)
        dp[i + 1][j + primes[i]] = max(dp[i + 1][j + primes[i]], dp[i][j] + 1);
    }
  }
  cout << dp[primes.size()][N] - 1 << '\n';
  return 0;
}