#include <stdio.h>
#include <stdlib.h>
int pava(int x,int y){
	int result = 1;
	for(int i=0;i<x;i++){
		result *= y;
	}
	return result;
}
int main(){
	int input;
	scanf("%d",&input);
	int *primes=(int*) malloc(input*sizeof(int));
	for(int i=0;i<input;i++){
		primes[i]=1;
	}
	primes[0]=0;
	primes[1]=0;
	for(int i=2;i<input;i++){
		if(primes[i]==1){
			for(int j=i*2;j<input;j+=i){
				primes[j]=0;
			}
		}
	}
	int count=0;
	int combination = 1;
	for(int i=3;i<input-1;i++){
		if(primes[i]){
			count++;
			combination *= 2;
		}
	}
	int *nevim_uz=(int*) malloc(sizeof(int)*(count+2));
	int index=0;
	for(int i=2;i<input-1;i++){
		if(primes[i]){
			nevim_uz[index++] = i;	
		}
	}
	nevim_uz[index++]=input;

//	printf("%d\n",combination);
	int invalid_count = 0;
	for(int i=0;i<index;i++){
		//printf("%d",nevim_uz[i]);
		for(int k=i;k>=0;--k){
			if(nevim_uz[i]-nevim_uz[k]>14){
				invalid_count=pava(k,2)*(pava((index-i-2),2));
 //printf(",%d-%d,%d,%d  %d,%d   %d",nevim_uz[k],nevim_uz[i],pava(k,2),k,(index-i-1),pava(index-i-1,2),invalid_count);
				combination -= invalid_count;
				break;
			}
		}
		//printf("\n");
	}
	free(primes);
	printf("%d\n",combination);
}