#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> prime;
    prime.push_back(2);
    for(int i = 3; i <= n; i++){
        bool ok = 1;
        for(int j = 0; j <prime.size(); j++) if(i%prime[j] == 0) ok = 0;
        if(ok) prime.push_back(i);
    }
    long long dp[prime.size()];
    for(int i = 0; i <prime.size(); i++) dp[i] = 0;
    dp[0] = 1;
    for(int i = 0; i < n; i++){
        int j = i + 1;
        while(j < prime.size() && prime[j] - prime[i] <= 14){
            dp[j] += dp[i];
            j++;
        }
    }
    cout << dp[prime.size()-1] << endl;
    return 0;
}