#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
const int MAX_N = 20010;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)

vector<int> p;
bool prime[MAX_N];
int dp[MAX_N][MAX_N];

void primeList(){
    fill(prime + 2, prime + MAX_N, true);
    for (int i = 2; i < MAX_N; i++){
        if (prime[i]){
            for (int j = 2 * i; j < MAX_N; j += i){
                prime[j] = false;
            }
        }
    }
}

int main(){
    primeList();
    int n, i, j;
    cin >> n;
    REP(i, n + 1){
        if (prime[i]) p.push_back(i);
    }

    REP(i, MAX_N) REP(j, MAX_N) dp[i][j] = -1;
    dp[0][0] = 0;
    REP(i, p.size()) REP(j, n + 1){
        if (j < p[i] || dp[i][j - p[i]] == -1) dp[i + 1][j] = dp[i][j];
        else dp[i + 1][j] = max(dp[i][j], dp[i][j - p[i]] + 1);
    }

    cout << dp[p.size()][n] << endl;

    return 0;
}