public static void main(String[] args)
{
    Scanner scan = new Scanner(System.in);

    int N = scan.nextInt();
    int x = 2;

    for(int i = 0; i <= N; i++)
    {
        int count = 0;

        for(int j = 1; j <= x; j++)
            if(x%j == 0)
                count++;

        if(count == 2)
            System.out.print(x + " ");

        x++;
    }
}

Scanner scan = new Scanner(System.in);
int N = Integer.parseInt( scan.nextLine());
int count = 0;
int num = 2;
while(count != N) { // while count!= number of prime numbers entered keep searching..
    boolean prime = true;// to determine whether the number is prime or not
    for (int i = 2; i <= Math.sqrt(num); i++) { //efficiency matters
        if (num % i == 0) {
            prime = false; // if number divides any other number its not a prime so set prime to false and break the loop.
            break;
        }

    }
    if (prime) {
        count++;
        System.out.println(num);
    }
    num++; see if next number is prime or not.
}

// Java Program to generate first 'N' Prime Numbers
public class prime
{
    public static void main(String[]args)
    {
        int count = 0, max_count = 100, i;
        System.out.println("First "+max_count+" Prime Numbers:");

        for(int num=1; count<max_count; num++)
        {
            for(i=2; num%i != 0; i++);

            if(i == num)
            {
                System.out.print(" "+num);
                count++;
            }
        }
    }
}

void printPrimeNumbers(int n) {
    ArrayList<Integer> primeNumbers = new ArrayList<>();
    primeNumbers.add(2);
    for (int i = 3; i < n; i+=2) { // skip over even numbers since they are not prime
        boolean isPrime = true;
        for (Integer prime : primeNumbers) { // check current prime numbers to see if it evenly divides into number
            if (i % prime == 0) { // when number is not prime
                isPrime = false;
                break; // optimization: stop checking when number is already not prime
            }
        }
        if (isPrime) {
            primeNumbers.add(i);
        }
    }
    System.out.println(primeNumbers);
}

public static void main(String... commandline_args)
{
  try
  {
        BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
        System.out.println("Please enter the limit of prime nos");
        int limit=Integer.parseInt(br.readLine());
        int checkLimit=0;
        int check=0;
    outer:  for(int i=2;;i++){
            check=0;
            for(int j=1;j<=i;j++)
            {
                if(i%j==0)
                {
                    check++;

                }
            }
            if(check==2)
            {
                checkLimit++;
                System.out.println(i);
                if(checkLimit==limit) break outer;
            }
        }
  }
  catch(Exception e)
  {
    System.out.println(e);
  }
}