Statement: Write a code to display all the non-prime numbers upto N.

Input: Only the value of N.

Output: The numbers which are not prime upto N (including N), each in a new line.

Constraints: 1 ≤ N ≤ 10^4

SAMPLE INPUT
25

SAMPLE OUTPUT
4
6
8
9
10
12
14
15
16
18
20
21
22
24
25

Explanation

In the above case, input is 25 (i.e., N=25) and the corresponding output is given alongside. Output contains only the non prime numbers upto 25.
def sieve(n):
	primes=[]
	multiples=set()
	for i in xrange(2,n+1):
		if i not in multiples:
			primes.append(i)
			multiples.update(range(i*i, n+1,i))
	return primes


n=input()
lst=sieve(n)
for i in xrange(2,n+1):
	if i not in lst:
		print i