int main() { int N,m ,i = 3 ; scanf("%d", &N); while(i < N ) { m = N - i; if( calc_prime(m) && calc_prime( i ) ) { printf("%d %d\n", i,(N-i)); break; } i++; } return 0; }
guint g_spaced_primes_closest (guint x) { int i; for (i = 0; i < G_N_ELEMENTS (prime_tbl); i++) { if (x <= prime_tbl [i]) return prime_tbl [i]; } return calc_prime (x); }
int main() { int n; calc_prime(); calc_prime_index(); while(scanf("%d",&n) != -1) { if (prime_index[n].count == 0) { printf("0\n"); } else { printf("%d\n",prime_index[n].count); print_prime(n); } } return 0; }