int main() { int n; init_prime_table(); while (scanf("%d", &n) && n) { printf("%d\n", numbers_of_consecutive_prime_sum_representation(n)); } return 0; }
int main(void) { init_prime_table(); for (unsigned n = 11; n < prime_max; n += 2) { if (is_prime(n)) { if (test_family(n)) { printf("%u\n", n); break; } } } return 0; }