#include int jump(int *arr, int start, int max) { int temp = 0, hop = 1; while (!(arr[start + hop] - arr[start] > 14)) { //printf("%d %d\n", arr[start], arr[start+hop]); if (arr[start+hop] == max) { temp +=1; break; } temp += jump(arr, start+hop, max); hop += 1; /*if (arr[start + hop] > max) { break; }*/ } return temp; } int main() { int max; 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}; scanf("%d", &max); //printf("%d", max); //max = 7; printf("%d", jump(primes, 0, max)); return 0; }