#include <bits/stdc++.h>
using namespace std;

#define st first
#define nd second
#define pb push_back
using ll = long long;
using db = double;
using ldb = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

bool is_prime(int p) {
    for (int i = 2; i < p; ++i)
        if (p % i == 0)
            return false;
    return true;
}

const int P = 211 + 7;
ll dp[P];

int main() {
    int p;
    scanf("%d", &p);
    vector<int> primes {2};
    for (int i = 3; i <= p; ++i)
        if (is_prime(i))
            primes.pb(i);
    dp[0] = 1;
    int n = primes.size();
    assert(primes.back() == p);

    for (int i = 1; i < n; ++i) {
        for (int j = 0; j < i; ++j)
            if (primes[i] - primes[j] <= 14)
                dp[i] += dp[j];
    }

    printf("%lld\n", dp[n - 1]);

    return 0;
}