import java.util.Scanner;

public class PrimeNumbers {
  
  // a method that tests if number is prime
  public static boolean isPrime(int n){
    boolean prime_flag = true; 
    for (int divisor = 2; divisor <= n/2 && prime_flag ; divisor++) {
      if (n % divisor == 0) { // If true, number is not prime
        prime_flag = false;          
      }
    }
    return prime_flag;
  }
  
  
  public static void main(String[] args) 
  {
    final int NUMBER_OF_PRIMES = 50; // Number of primes to display
    int count = 0; // Count the number of prime numbers
    int number = 2; // A number to be tested for primeness
    
    System.out.println("The first 50 prime numbers are");
    
    // Repeatedly find prime numbers
    while (count < NUMBER_OF_PRIMES) {
      // Print the prime number and increase the count
      if (isPrime(number)) {
        count++; // Increase the count
        System.out.print(number + " ");
      }
      // Check if the next number is prime
      number++;
    }
  }
}