#include <bits/stdc++.h>

using namespace std;

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, 223, 227, 229, 233, 239, 241, 251};
uint64_t counter = 0;
int P;

uint64_t cache[54];

uint64_t jump(int i){

    if(cache[i]!=UINT64_MAX){
        // printf("\t\tcache hit prime %d has %d possib\n",primes[i], cache[i]);
        return cache[i];
    }

    if(primes[i] == P){
        return 1;
    }

    int acc = 0;
    for (int j = min(54, i+14); j > i; j--){

        if(primes[j] - primes[i] < 15 && primes[j]<= P){
            // printf("%d --> %d\n", primes[i], primes[j]);
            uint64_t tmp = jump(j);
            // printf("%d --> %d = %d\n", primes[i], primes[j], tmp);
            acc += tmp;
        }

    }
    // printf("\t%d --> %d has %d possib\n\n", primes[i], P, acc);
    cache[i] = acc;

    return cache[i];
}



int32_t main() {
    

    scanf("%d", &P);

    for (size_t i = 0; i < 54; i++)
    {
        cache[i]=UINT64_MAX;
        if(primes[i]==P){
           cache[i] = 1; 
        }
    }
    

    counter = jump(0);

    // printf("P %d  Pi %d\n\n", P, P_i);
    printf("%lu\n", counter);

    return 0;
}