public class SieveOfEratosthenes {
    public static void main(String[] args) {
	int n = Integer.parseInt(args[0]);
	boolean[] prime = new boolean[n];
	for (int i = 0; i < n; i++) prime[i] = true;
	prime[0] = false;  prime[1] = false;

	for (int i = 2; i < n; i++) {
	    if (prime[i]) {
		System.out.println(i);
		for (int j = 2; j*i < n; j++) prime[j*i] = false;
	    }
	}
    }
}