import java.io.*;

class Primzahlen {

  final static int n = 1000;

  public static void main(String argv[]){
    boolean[] primes = new boolean[n+1];
            // primes[i] <==> i ist Primzahl 
    int i,j,k;
    for (i=1; i<=n; i++) primes[i] = true;
    primes[1] = false;
    k = (int)Math.sqrt(n);
    for (i=2; i<=k; i++){
      if (primes[i]){
	j = i + i;
	while (j<=n) {
	  primes[j] = false;
	  j += i;
	}
      }
    }
    for (i=1; i<=n; i++) 
      if (primes[i]) System.out.println(i);
  }
}