#include <bits/stdc++.h>
#include <string>
#define ft first
#define sc second
#define pt(sth) cout << sth << "\n"
#define chmax(a, b) {if(a<b) a=b;}
#define chmin(a, b) {if(a>b) a=b;}
#define moC(a, s, b) (a)=((a)s(b)+MOD)%MOD
using namespace std;
typedef long long ll;
typedef pair<ll, ll> PL;
static const ll INF=1e18;
static const ll MAX=101010;
static const ll MOD=1e9+7;


/*
 for(i=0; i<N; i++)
   cin >> a[i];
*/

vector<ll> ps;

void eratos(ll N) {
  ll isp[N+5];
  memset(isp, 1, sizeof(isp));
  isp[0]=isp[1]=0;
  ll i, j;
  
  for(i=2; i*i<=N; i++) {
    if(isp[i]==0) continue;
    for(j=i+i; j<=N; j+=i)
      isp[j]=0;
  }
  
  for(i=0; i<=N; i++) if(isp[i]) ps.push_back(i);
}

ll dp[2333][22222];

int main(void) {
  ll i, j, k;
  
  ll N;
  cin >> N;
  eratos(N);
  
  for(i=0; i<=ps.size(); i++)
    for(j=0; j<=N; j++)
      dp[i][j]=-1;
  
  dp[0][0]=0;
  for(i=0; i<ps.size(); i++) {
    for(j=0; j<=N; j++) {
      if(dp[i][j]==-1) continue;
      chmax(dp[i+1][j], dp[i][j]);
      
      if(j+ps[i]>N) continue;
      chmax(dp[i+1][j+ps[i]], dp[i][j]+1);
    }
  }
  
  pt(dp[ps.size()][N]);
  
  
}