#include <stdio.h>
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#include <functional>
#include <map>
#include <iomanip>
#include <math.h> 
#include <stack>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <tuple>
#include <cctype>
#include <ctype.h>
#include <set>
#include <sstream>

int N;
//#define N 20000
using namespace std;

int arr[200000];
vector<int>slist;

//エラトステネスの篩
void Eratosthenes() {
	for (int i = 0; i < N; i++) {
		arr[i] = 1;
	}
	for (int i = 2; i < sqrt(N); i++) {
		if (arr[i]) {
			for (int j = 0; i * (j + 2) < N; j++) {
				arr[i *(j + 2)] = 0;
			}
		}
	}

	for (int i = 2; i < N; i++) {
		if (arr[i]) {
			//cout << i << endl;
			slist.push_back(i);
		}
	}
}



//素数
int main(int argc, char const *argv[]) {
	int i, j;
	//int n;
	vector<vector<int>>dp(5005, vector<int>(20005, -1));

	//Eratosthenes();

	cin >> N;

	Eratosthenes();

	//dp[0][0] = 0;
	//dp[0][slist[0]] = 1;
	//int cnt = 0;

	for (i = 0; i < slist.size(); i++) {
		//if (arr[i] > n) break;
		//cnt++;

		dp[i][slist[i]] = max(1, dp[i][slist[i]] );
		
		//for (j = 0; j <= N; j++) {
		//for (j = 0; j <= N; j++) {
		for (j = N; j >= 0; j--) {

			
			if (j >= slist[i] && ( dp[i][j - slist[i]] != -1) ) {
				//dp[i + 1][j] = max(dp[i][j] + dp[i][j - slist[i]] + 1, dp[i + 1][j] );
				//dp[i + 1][j] = max(dp[i][j] + dp[i][j - slist[i]] , dp[i + 1][j]);
				//dp[i + 1][j] = max( dp[i][j - slist[i]] + 1, dp[i + 1][j]);
				//if (j - slist[i] == slist[i]) {
				//	//dp[i + 1][j] = dp[i][j];
				//}
				//else {
				//	dp[i + 1][j] = max(dp[i][j], dp[i][j - slist[i]] );
				//}
				//if (dp[i][j - slist[i]] != -1) {
					dp[i + 1][j] = max(dp[i][j - slist[i]] + 1, dp[i][j]);
				//}
				//dp[i + 1][j] = dp[i][j] + dp[i][j - slist[i]];

			}
			else {
				if (dp[i][j] != -1) {
					dp[i + 1][j] = dp[i][j];
				}
			}

		
		}


	}

	
	cout << dp[slist.size()][N] << endl;




	getchar();
	getchar();
	return 0;
}