def count_divisors(n) :
	result = 1
	i = 1
	while i**2 < n :
		i += 1
		temp = 1
		while n%i == 0 :
			n /= i
			temp += 1
		result *= temp
	if n != 1 :
		result *= 2
	return result

def solve(n) :
	last_max = 1
	for i in range(2, n+1) :
		temp = count_divisors(i)
		if temp > last_max :
			print i
			last_max = temp

solve(1000000)