#include <iostream>
using namespace std;

size_t array[212] = {2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,49,53,55,59,61,65,67,71,73,77,79,83,85,89,91,95,97,101,103,107,109,111,113,115,117,119,121,123,125,127,129,131,133,135,137,139,141,143,145,147,149,151,153,155,157,159,161,163,165,167,169,171,173,175,177,179,181,183,185,187,189,191,193,195,197,199,201,203,205,207,209,211};


void recursive(size_t & number, size_t position, size_t & check){
    for (size_t i = position +1; array[i] <=check && array[i] - array[position] <=14; ++i) {
        if (array[i] == check){
            number = number +1;
            return;
        }
        recursive(number, i, check);
    }
}

int main() {
    size_t answer = 0;
    size_t check = 31;
cin >> check;
    recursive(answer,0,check);
    cout << answer << endl;
    /*for (int i = 0; i < 212; i++) {
        array[i] = true;
    }*/

    /*for (int i = 2; i < 212/2; ++i) {
        size_t tmp = i;
        for (int j = 2; tmp * j < 212; ++j) {
            tmp = i * j;
            array[tmp] = false;
        }
    }

    cout << "{";
    for (int i = 2; i < 212; ++i) {
        if (array[i] == true) cout << i << ",";
    } */
}