#include <iostream>
#include <vector>
#include <cmath>
#include <map>

using namespace std;

int result = 0;
std::vector<int> m_Primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211 };
vector<long long>Map(211, -1);

long long recursion ( int max, int index ) {
    if ( m_Primes[index] == max ) {
        Map[index] = 1;
        return 1;
    }

    long long count = 0;
    for ( int i = index+1; m_Primes[index] + 14 >= m_Primes[i] && m_Primes[i] <= max; i++ ) {
        if ( Map[i] != -1 ) {
            count += Map[i];
        }
        else {
            count += recursion(max, i);
        }
    }
    Map[index] = count;

    return count;
}

int main() {
    int max;
    cin >> max;

    cout << recursion(max, 0 );
    return 0;
}