package ro.

sda;
import java.util.Scanner;
public class exercitiu2 {
public static class FirstNPrimes {

public static void IsPrimeNumber(int number) {

int divisor = 0;

for (int i = 2; i < number; i++) {

if (number % i == 0) {
divisor ++;
}
}
}

}
public static void printFirstNPrimes(int n){
int primesFound = 0;
int i = 2;
while(primesFound < n){
int divisors = 0;
for(int j = 2; j < i; j++){
if(i % j == 0){
divisors++;
}
}
if(divisors == 0){
System.out.println("numarul " + i + " este prim");
primesFound++;

}
i++;
}

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
System.out.println("Determining first " + n + "primes");

printFirstNPrimes(n);
}