#include <bits/stdc++.h>
using namespace std;
int main() {
	ios_base::sync_with_stdio(false);
	
	int n; cin >> n; n++;
	vector <int> prime;
	vector <bool> eras(n, true);
	for (int i = 2; i < n; i+=2) {
		if (eras[i]) {
			prime.push_back(i);
			if (i*i < n) for (int j = i*i; j < n; j+=i) eras[j] = false;
		}
		if (i == 2) i--;
	}
	//for (int p : prime) cout << ' ' << p;
	//cout << endl;
	
	uint64_t sum = 1;
	queue <uint64_t> q;
	q.push(1);
	for (int l = 0, r = 2; r < (int)prime.size(); r++) {
		q.push(sum);
		sum += sum;
		while (prime[l]+14 < prime[r]) {
			sum -= q.front();
			q.pop();
			l++;
		}
		//cout << ' ' << prime[r] << ' ' << sum << endl;;
	}
	cout << sum << endl;
	
	return 0;
}