public class prime {
    public static void main(String[]args){
        for(int k=2;k<=1000;k++){
          if (isPrime(k)){
          System.out.println(k);
          }
        }
    }


    public static boolean isPrime(int n){
    boolean prime=false;
    if (n==2)
        return true;
    else if (n%2==0)
        return false;
    else{
        int limit=(int)Math.sqrt(n);
        int k;
    for (k=3; k<=limit;k+=2){
        if(n%k==0) break;
    }
    prime=n%k!=0;
    }
    return prime;
    }
}