#include <stdio.h>
#include <stdlib.h>

#define N 300000000

int is_prime[N];
int primes[N];
int count; //‘f”‚̐”

int sequence(int n) {
    int i, j, k, flag, next, diff=1;
    
    diff = 1; // Œφ·  n–’–ž‚Μ‘f”‚̐ς̔{”
    for (j = 1; j<n; j++)  if (is_prime[j] == 1) diff *= j;
    for (j = diff; j < (N/diff); j += diff) {
        for (i = 1; i <count- n+1; ++i) {
            flag=1;
            for (k = 1; k < n; ++k) {
                next = primes[i] + k * j;
                if (next >= N || is_prime[next] == 0) {
                    flag = 0; break;
                }
            }
            if (flag == 1) {
                printf("%d ŒΒ‚Μ‘f”—ρ(Œφ·%d = %d*%d)F",n,j,diff,j/diff); 
                for (k = 1; k<=n; k++) printf("%d ", primes[i]+(k-1)* j);
                printf("\n"); 
                return 1;
            }
        }
    }
    
    return 0;
}

int main(int argc, char *argv[]) {
    int i, j;

        /* ƒGƒ‰ƒgƒXƒeƒlƒX‚ΜβΏ  */
    for (i = 2; i < N; ++i) is_prime[i] = 1;
    
    count = 0;
    for (i = 2; i < N; ++i) {
        if (is_prime[i] == 1) {
            primes[count++] = i;
            for (j = i + i; j < N; j += i) is_prime[j] = 0;
        }
    }

    for (i = 3; i < 16; ++i)  sequence(i);
    return 0;
}