#include <stdio.h>
int isPrime(int number);
int main(void)
{
    int n, count = 0, candidate = 2;
    if (scanf("%d", &n) != 1 || n < 1 || n > 100) {
        puts("Enter a prime count from 1 to 100."); return 1;
    }
    printf("First %d primes:", n);
    while (count < n) {
        if (isPrime(candidate)) { printf(" %d", candidate); count++; }
        candidate++;
    }
    putchar('\n');
    return 0;
}
int isPrime(int number)
{
    int divisor;
    if (number < 2) return 0;
    for (divisor = 2; divisor <= number / divisor; divisor++) {
        if (number % divisor == 0) return 0;
    }
    return 1;
}