#include <stdio.h>
#include <math.h>

bool prime(int p);

int main() {
    int n, k;
    int p, d;
    printf("Input n:\n");
    scanf("%d", &n);

    k = 0;

    p = 2;
    printf("%d ", p);
    ++k;                // Number of primes

    p = 3;
    while (k < n) {
        if (prime(p)) {
            printf("%d ", p);
            ++k;
            if (k % 10 == 0)
                printf("\n");
        }
        p += 2;
    }
    printf("\n");

    return 0;
}
        
bool prime(int p) {
    if (p < 2)
        return false;           // 0, 1 are not prime
    else if (p == 2)
        return true;            // 2 is prime
    else if (p % 2 == 0)
        return false;           // p is even

    // p > 1 is odd
    int d = 3;                  // divizor
    while (d*d <= p) {
        if (p % d == 0) {
            return false;
        }
        d += 2;
    }
    return true;
}