#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<stack>
#include<cstdio>
#include<sstream>
#include<iomanip>
#include<assert.h>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-7;
const int inf=1e8;
const ll INF=1e16;
int dx[4]={0,1,0,-1};
int dy[4]={1,0,-1,0};
#define MAX 20020
int sos[MAX]={1,1,0};
vi sosu;
void init(){
	for(int i=2;i*i<=MAX;i++)if(!sos[i])
	for(int j=i*2;j<MAX;j+=i)sos[j]=true;
	rep(i,MAX)if(sos[i]==0)sosu.pb(i);
}
int main(){
	init();
	vi dp(20020);
	dp[0]=1;
	rep(i,sosu.size())for(int j=20019;j>=sosu[i];j--)if(dp[j-sosu[i]])dp[j]=max(dp[j],dp[j-sosu[i]]+1);
	int n;
	cin>>n;
	cout<<dp[n]-1<<endl;
}