#include <stdio.h>
 
int isPrime(int num) {
    if (num < 2) return 0;
    int i;
    for (i = 2; i * i <= num; i++)
        if (num % i == 0) return 0;
    return 1;
}
 
int main() {
    int n, count = 0, num = 2;
    printf("Enter n: ");
    scanf("%d", &n);
    printf("First %d prime numbers: ", n);
    while (count < n) {
        if (isPrime(num)) {
            printf("%d ", num);
            count++;
        }
        num++;
    }
    printf("\n");
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgaXNQcmltZShpbnQgbnVtKSB7CiAgICBpZiAobnVtIDwgMikgcmV0dXJuIDA7CiAgICBpbnQgaTsKICAgIGZvciAoaSA9IDI7IGkgKiBpIDw9IG51bTsgaSsrKQogICAgICAgIGlmIChudW0gJSBpID09IDApIHJldHVybiAwOwogICAgcmV0dXJuIDE7Cn0KCmludCBtYWluKCkgewogICAgaW50IG4sIGNvdW50ID0gMCwgbnVtID0gMjsKICAgIHByaW50ZigiRW50ZXIgbjogIik7CiAgICBzY2FuZigiJWQiLCAmbik7CiAgICBwcmludGYoIkZpcnN0ICVkIHByaW1lIG51bWJlcnM6ICIsIG4pOwogICAgd2hpbGUgKGNvdW50IDwgbikgewogICAgICAgIGlmIChpc1ByaW1lKG51bSkpIHsKICAgICAgICAgICAgcHJpbnRmKCIlZCAiLCBudW0pOwogICAgICAgICAgICBjb3VudCsrOwogICAgICAgIH0KICAgICAgICBudW0rKzsKICAgIH0KICAgIHByaW50ZigiXG4iKTsKICAgIHJldHVybiAwOwp9

NQ==

5