#include <iostream>
#include <algorithm>
#include <vector>
#include <math.h>

using namespace std;

int main()
{
    int P;
    cin >> P;
    vector<int> 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<int> num_primes_before(primes.size(), 0);
    
    num_primes_before[0] = 1;
    for (int i = 1; primes[i] <= P; i++)
    {
        // cout << "cur prime: " << primes[i] << "\n";
        for (int j = i - 1; primes[i] - primes[j] <= 14; j--)
        {
            // cout << "  j = " << j << "\n";
            if (j < 0)
            {
                break;
            }
            // cout << "   num_p = " << num_primes_before[j] << "\n";
            num_primes_before[i] += num_primes_before[j];
        }
        if (primes[i] == P)
        {
            cout << num_primes_before[i] << "\n";
        }
    }
    


    return 0;
}


    // for (int i = 2; i <= 211; i++)
    // {
    //     // cout << i << "\n";
    //     bool is_prime = true;
    //     for (int j = 2; j < i; j++)
    //     {
    //     // cout << "   " << j << "\n";
    //         if (i % j == 0)
    //         {
    //             is_prime = false;
    //             break;
    //         }
    //     }
    //     if (is_prime)
    //     {
    //         cout << i << ", ";
    //     }

    // }