Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals to n.

Let us remind you the definition of the greatest common divisor: GCD(a1, ..., ak) = d, where d represents such a maximal positive number that each ai (1 ≤ i ≤ k) is evenly divisible by d. At that, we assume that all ai's are greater than zero.

Knowing that Petya is keen on programming, his friends has agreed beforehand that the 1-st friend gives a1 sweets, the 2-nd one gives a2 sweets, ..., the n-th one gives an sweets. At the same time, for any i and j (1 ≤ i, j ≤ n) they want the GCD(ai, aj) not to be equal to 1. However, they also want the following condition to be satisfied: GCD(a1, a2, ..., an) = 1. One more: all the ai should be distinct.

Help the friends to choose the suitable numbers a1, ..., an.

Input

The first line contains an integer n (2 ≤ n ≤ 50).

Output

If there is no answer, print "-1" without quotes. Otherwise print a set of n distinct positive numbers a1, a2, ..., an. Each line must contain one number. Each number must consist of not more than 100 digits, and must not contain any leading zeros. If there are several solutions to that problem, print any of them.

Do not forget, please, that all of the following conditions must be true:

  * For every i and j (1 ≤ i, j ≤ n): GCD(ai, aj) ≠ 1
  * GCD(a1, a2, ..., an) = 1
  * For every i and j (1 ≤ i, j ≤ n, i ≠ j): ai ≠ aj



Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Examples

Input

3


Output

99
55
11115


Input

4


Output

385
360
792
8360

Source: codeforces | Difficulty: MEDIUM_HARD
Tags: Number theory

Mathematics

Constructive algorithms


Solutions:
import math

def checkprime(n):
	if n == 1:
		return 0
	i = 2
	while i * i <= n:
		if n % i == 0:
			return 0
		i += 1
	return 1
primes = []
primes.append(0)
i = 1
while i <= 1000:
	if checkprime(i) == 1:
		primes.append(i)
	i += 1
n = int(input())
if n == 2:
	print(-1)
	exit(0)
res = []
i = 1
while i <= n:
	product = 1
	j = i
	while j < i + n - 1:
		if j == n:
			product *= primes[n]
		else:
			product *= primes[j % n]
		j += 1
	res.append(product)
	i += 1
for x in res:
	print(x)


def isprime(a):
	if a == 1 or a == 0 or a == 2:
		return 0
	x = 2
	while x * x <= a:
		if a % x == 0:
			return 0
		x += 1
	return 1
primes = []
m = 1
cnt = 0
for x in range(1, 300):
	if isprime(x):
		primes.append(x)
n = int(input())
if n == 2:
	print(-1)
else:
	for i in range(0, n - 1):
		print(2 * primes[i])
		m = m * primes[i]
	print(m)


def check(n):
	for i in range(2, 1221222222):
		if i * i > n:
			break
		if n % i == 0:
			return 0
	return 1
n = int(input())
if n == 2:
	print(-1)
	exit(0)
primes = []
for i in range(2, 3132):
	if check(i):
		primes.append(i)
ans = []
pt = []
for i in range(0, n):
	pt.append(primes[i])
mul = 1
for i in pt:
	mul *= i
for i in pt:
	ans.append(mul // i)
for i in ans:
	print(i)


def isprime(z):
	if z == 2:
		return 1
	if z % 2 == 0 or z < 2:
		return 0
	for i in range(2, int(z ** 0.5 + 1)):
		if z % i == 0:
			return 0
	return 1
n = int(input())
if n == 2:
	exit(print(-1))
(x, i, p) = (n, 2, [])
while x > 0:
	if isprime(i):
		p.append(i)
		x -= 1
	i += 1
s = [0]
for i in range(n - 1):
	s.append(1)
for i in range(n):
	if i > 0:
		(s[i], s[i - 1]) = (s[i - 1], s[i])
	a = 1
	for j in range(n):
		if s[j]:
			a *= p[j]
	print(a)


prime = [True] * 100000
n = int(input())
prime[1] = False
primes = []
for i in range(2, 100000):
	if prime[i]:
		primes.append(i)
		j = 2 * i
		while j < 100000:
			prime[j] = False
			j += i
if n == 2:
	print(-1)
	exit(0)
a = 1
for i in range(0, n):
	a *= primes[i]
for i in range(0, n):
	print(a // primes[i])


n = int(input())
if n == 2:
	print(-1)
	exit()
MX = 1001
isp = [1 for i in range(0, MX)]
isp[0] = isp[1] = 0
primes = []
for i in range(2, MX):
	if not isp[i]:
		continue
	primes.append(i)
	for j in range(i * i, MX, i):
		isp[j] = 0
product = 1
for i in range(n):
	product *= primes[i]
for i in range(n):
	print(product // primes[i])


import math
primes = []

def isprime(n):
	if n == 1:
		return False
	elif n < 4:
		return True
	for i in range(2, math.ceil(math.sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True

def solve():
	n = int(input())
	if n == 2:
		print(-1)
		return
	product = 1
	cnt = 0
	for i in range(3, 10000):
		if isprime(i):
			product *= i
			print(2 * i)
			cnt += 1
			if cnt == n - 1:
				break
	print(product)
	return
solve()


import math
n = int(input())
if n == 2:
	print(-1)
	exit(0)
print(15)
print(10)
print(12)
n -= 3
m = 2
while n > 0:
	n -= 1
	print(12 * m)
	m += 1


n = int(input())
if n < 3:
	print(-1)
	exit()
a = [[0 for _ in range(n)] for o in range(n)]
c = 0

def isprime(x):
	for i in range(2, int(x ** 0.5) + 1):
		if x % i == 0:
			return 0
	return 1
i = 2
while c != n:
	if isprime(i):
		c += 1
		for j in range(n):
			a[c - 1][j] = i
	i += 1
for i in range(0, n):
	for j in range(i + 2, n):
		a[i][j] = 1
for i in range(1, n):
	a[i][i - 1] = 1
for i in range(n):
	p = 1
	for j in range(n):
		p *= a[j][i]
	print(p)


def isPrime(n):
	if n == 1:
		return False
	for i in range(2, n):
		if n % i == 0:
			return False
	return True
primes = []
for i in range(2, 1000):
	if isPrime(i):
		primes.append(i)
	if len(primes) == 50:
		break
n = int(input())
if n == 2:
	print(-1)
	exit()
prod = 1
for i in range(n):
	prod *= primes[i]
for i in range(n):
	print(prod // primes[i])


def go(x):
	for i in range(2, x):
		if x % i == 0:
			return False
		if i * i > x:
			break
	return True
n = int(input())
if n == 2:
	print(-1)
	exit()
a = []
i = 3
a.append(2)
l = 1
while True:
	if go(i) == True:
		a.append(i)
		l += 1
	if l == n:
		break
	i += 2
for i in range(0, n):
	s = 1
	for j in range(0, n):
		if i != j:
			s *= a[j]
	print(s)


n = int(input())
a = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233]
ans = 1
if n == 1 or n == 2:
	print(-1)
else:
	for i in range(1, n):
		print(2 * a[i])
	for i in range(1, n + 1):
		ans *= a[i]
	print(ans)


import sys

def genprimes(n=51):
	primes = [2]
	cur = 3
	while True:
		works = True
		for val in primes:
			if val * val > cur:
				break
			if cur % val == 0:
				works = False
				break
		if works:
			primes.append(cur)
		cur += 1
		if len(primes) >= n:
			return primes

def solve():
	(n,) = rv()
	if n == 2:
		print(-1)
		return
	primes = genprimes(200)
	for i in range(n):
		res = list()
		for j in range(i, min(n + 1, i + n - 1)):
			res.append(primes[j])
		if i == n - 1:
			res[-1] = 2
		ans = 1
		for val in res:
			ans *= val
		print(ans)

def rv():
	return map(int, input().split())

def rl(n):
	return [list(map(int, input().split())) for _ in range(n)]
if sys.hexversion == 50594544:
	sys.stdin = open('test.txt')
solve()


n = int(input())
if n == 2:
	print(-1)
else:
	print(99)
	print(55)
	k = 0
	for i in range(0, n - 2):
		print(2 * 2 * 15 * (k + 1))
		k += 1


from math import log10

def eratosphene(n):
	ans = [0] * (n + 1)
	ans[0] = ans[1] = 1
	for i in range(2, n + 1):
		if ans[i]:
			continue
		for j in range(i * i, n + 1, i):
			ans[j] = 1
	return ans
n = int(input())
primes = eratosphene(1000)
cur = []
for i in range(len(primes)):
	if not primes[i]:
		cur.append(i)
	if len(cur) == n:
		break
pr = 1
for i in range(len(cur)):
	pr *= cur[i]
if n == 2:
	print(-1)
	exit(0)
for i in range(n):
	print(pr // cur[i])


primes = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257]
n = input()
n = int(n)
import math
ans = []
for i in range(n):
	ans.append(1)
nx = 1
for i in range(n - 1):
	ans[0] *= primes[i]
	ans[nx] *= primes[i]
	nx = nx + 1
for i in range(1, n, 1):
	ans[i] *= primes[n - 1]
g = 0
if n == 2:
	print(-1)
else:
	for i in ans:
		g = math.gcd(g, i)
		print(i)


isprime = [1 for i in range(2002)]
isprime[0] = 0
isprime[1] = 0
for i in range(2, 2000, 1):
	if isprime[i]:
		j = i * i
		while j < 2000:
			isprime[j] = 0
			j += i
prime = []
for i in range(2, 2000, 1):
	if isprime[i]:
		prime.append(i)
n = int(input())
if n == 2:
	print('-1')
	exit(0)
for i in range(n):
	val = 1
	for j in range(n):
		if i == j:
			continue
		val *= prime[j]
	print(val)


p = [True] * 230
i = 2
while i * i <= len(p):
	if p[i]:
		for j in range(i + i, len(p), i):
			p[j] = False
	i += 1
p = [i for i in range(2, len(p)) if p[i]]
n = int(input())
if n == 2:
	print(-1)
else:
	x = 1
	for i in range(n):
		x *= p[i]
	for i in range(n):
		print(x // p[i])


primes = []

def sieve(n):
	isPrime = [True for i in range(n + 1)]
	primes.append(2)
	for i in range(4, n + 1, 2):
		isPrime[i] = False
	for i in range(3, n + 1, 2):
		if isPrime[i]:
			primes.append(i)
			j = i
			while i * j <= n:
				isPrime[i * j] = False
				j += 1

def main():
	n = int(input())
	if n == 2:
		print(-1)
	else:
		sieve(250)
		sup = 1
		for i in range(n):
			sup *= primes[i]
		for i in range(n):
			print(sup // primes[i])
main()


a = []
for i in range(2, 1000):
	pr = 1
	for j in range(2, i):
		if i % j == 0:
			pr = 0
	if pr == 1:
		a.append(i)

def gcd(x, y):
	if y == 0:
		return x
	return gcd(y, x % y)
cur = 1
n = int(input())
if n == 2:
	print(-1)
	exit()
for i in range(n):
	cur = cur * a[i]
b = []
for i in range(n):
	print(cur // a[i])


n = int(input())
if n == 2:
	print(-1)
	quit()
a = [1 for i in range(n)]
for i in range(n - 1):
	a[i] *= 2
for i in range(1, n):
	a[i] *= 3
length = 100000
prime = [True for i in range(length)]
last = -1
for i in range(2, length):
	if prime[i]:
		j = i * i
		last = j
		while j < length:
			prime[j] = False
			j += i
a[0] *= last
a[n - 1] *= last
cur = 1
for i in range(1, n - 1):
	a[i] *= cur
	cur += 1
	while cur % last == 0:
		cur += 1
	if len(str(cur)) > 100:
		print(-1)
		quit()
for x in a:
	print(x)


n = int(input())
t = [10, 15] + [6 << i for i in range(n - 2)]
print(-1 if n < 3 else '\n'.join(map(str, t)))


n = int(input())
if n == 2:
	print('-1')
else:
	a = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541]
	l = []
	pro = 1
	for i in range(0, n - 1):
		l.append(a[i] * a[n - 1])
		pro = pro * a[i]
	l.append(pro)
	for k in l:
		print(k)


def main():
	SIZE = 100000
	sieve = [True] * SIZE
	p = list()
	for it1 in range(2, SIZE):
		if sieve[it1]:
			for it2 in range(it1 * it1, SIZE, it1):
				sieve[it2] = False
			p.append(it1)
	n = int(input())
	if n == 2:
		print(-1)
		exit(0)
	v = [1] * n
	pib = 0
	for it1 in range(n):
		for it2 in range(it1 + 1, n):
			if pib == n + 2:
				pib = 0
			v[it1] *= p[pib]
			v[it2] *= p[pib]
			pib += 1
	print('\n'.join((str(it) for it in v)))
main()


n = int(input())
if n == 2:
	print(-1)
	exit(0)
res = []
res.append(6)
res.append(10)
res.append(15)
i = 2
while len(res) < n:
	res.append(6 * i)
	i += 1
for x in res:
	print(x)


import sys
from math import *
from fractions import gcd
readints = lambda : map(int, input().strip('\n').split())

def isprime(x):
	f = 2
	while f * f <= x:
		if x % f == 0:
			return False
		f += 1
	return True
primes = []
for i in range(2, 1000):
	if isprime(i):
		primes.append(i)
n = int(input())
if n == 2:
	print(-1)
	sys.exit(0)
A = 1
for i in range(n):
	A *= primes[i]
ans = []
for i in range(n):
	ans.append(A // primes[i])
for x in ans:
	print(x)


maxn = 10000 + 10
prime = []
p = [False for i in range(maxn)]

def sieve():
	for i in range(2, maxn):
		if not p[i]:
			prime.append(i)
		for j in range(maxn):
			if i * prime[j] >= maxn:
				break
			p[i * prime[j]] = True
			if i % prime[j] == 0:
				break

def main():
	sieve()
	n = int(input())
	if n == 2:
		print('-1')
		exit(0)
	for i in range(n):
		a = 1
		for j in range(n):
			if j == i:
				continue
			a *= prime[j]
		print(a)
main()


from sys import exit
n = int(input())
if n is 2:
	print(-1)
	exit(0)
print(6)
print(10)
print(15)
last = 15
for i in range(n - 3):
	last *= 2
	print(last)


p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397, 401, 409, 419, 421, 431, 433, 439, 443, 449, 457, 461, 463, 467, 479, 487, 491, 499, 503, 509, 521, 523, 541, 547, 557, 563, 569, 571, 577, 587, 593, 599, 601, 607, 613, 617, 619, 631, 641, 643, 647, 653, 659, 661, 673, 677, 683, 691, 701, 709, 719, 727, 733, 739, 743, 751, 757, 761, 769, 773, 787, 797, 809, 811, 821, 823, 827, 829, 839, 853, 857, 859, 863, 877, 881, 883, 887, 907, 911, 919, 929, 937, 941, 947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013, 1019, 1021, 1031, 1033, 1039, 1049, 1051, 1061, 1063, 1069, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1123, 1129, 1151, 1153, 1163, 1171, 1181, 1187, 1193, 1201, 1213, 1217, 1223, 1229, 1231, 1237, 1249, 1259, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1319, 1321, 1327, 1361, 1367, 1373, 1381, 1399, 1409, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1459, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1511, 1523, 1531, 1543, 1549, 1553, 1559, 1567, 1571, 1579, 1583, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1637, 1657, 1663, 1667, 1669, 1693, 1697, 1699, 1709, 1721, 1723, 1733, 1741, 1747, 1753, 1759, 1777, 1783, 1787, 1789, 1801, 1811, 1823, 1831, 1847, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1901, 1907, 1913, 1931, 1933, 1949, 1951, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2027, 2029, 2039, 2053, 2063, 2069, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2129, 2131, 2137, 2141, 2143, 2153, 2161, 2179, 2203, 2207, 2213, 2221, 2237, 2239, 2243, 2251, 2267, 2269, 2273, 2281, 2287, 2293, 2297, 2309, 2311, 2333, 2339, 2341, 2347, 2351, 2357, 2371, 2377, 2381, 2383, 2389, 2393, 2399, 2411, 2417, 2423, 2437, 2441, 2447, 2459, 2467, 2473, 2477, 2503, 2521, 2531, 2539, 2543, 2549, 2551, 2557, 2579, 2591, 2593, 2609, 2617, 2621, 2633, 2647, 2657, 2659, 2663, 2671, 2677, 2683, 2687, 2689, 2693, 2699, 2707, 2711, 2713, 2719, 2729, 2731, 2741, 2749, 2753, 2767, 2777, 2789, 2791, 2797, 2801, 2803, 2819, 2833, 2837, 2843, 2851, 2857, 2861, 2879, 2887, 2897, 2903, 2909, 2917, 2927, 2939, 2953, 2957, 2963, 2969, 2971, 2999, 3001, 3011, 3019, 3023, 3037, 3041, 3049, 3061, 3067, 3079, 3083, 3089, 3109, 3119, 3121, 3137, 3163, 3167, 3169, 3181, 3187, 3191, 3203, 3209, 3217, 3221, 3229, 3251, 3253, 3257, 3259, 3271, 3299, 3301, 3307, 3313, 3319, 3323, 3329, 3331, 3343, 3347, 3359, 3361, 3371, 3373, 3389, 3391, 3407, 3413, 3433, 3449, 3457, 3461, 3463, 3467, 3469, 3491, 3499, 3511, 3517, 3527, 3529, 3533, 3539, 3541, 3547, 3557, 3559, 3571, 3581, 3583, 3593, 3607, 3613, 3617, 3623, 3631, 3637, 3643, 3659, 3671, 3673, 3677, 3691, 3697, 3701, 3709, 3719, 3727, 3733, 3739, 3761, 3767, 3769, 3779, 3793, 3797, 3803, 3821, 3823, 3833, 3847, 3851, 3853, 3863, 3877, 3881, 3889, 3907, 3911, 3917, 3919, 3923, 3929, 3931, 3943, 3947, 3967, 3989, 4001, 4003, 4007, 4013, 4019, 4021, 4027, 4049, 4051, 4057, 4073, 4079, 4091, 4093, 4099, 4111, 4127, 4129, 4133, 4139, 4153, 4157, 4159, 4177, 4201, 4211, 4217, 4219, 4229, 4231, 4241, 4243, 4253, 4259, 4261, 4271, 4273, 4283, 4289, 4297, 4327, 4337, 4339, 4349, 4357, 4363, 4373, 4391, 4397, 4409, 4421, 4423, 4441, 4447, 4451, 4457, 4463, 4481, 4483, 4493, 4507, 4513, 4517, 4519, 4523, 4547, 4549, 4561, 4567, 4583, 4591, 4597, 4603, 4621, 4637, 4639, 4643, 4649, 4651, 4657, 4663, 4673, 4679, 4691, 4703, 4721, 4723, 4729, 4733, 4751, 4759, 4783, 4787, 4789, 4793, 4799, 4801, 4813, 4817, 4831, 4861, 4871, 4877, 4889, 4903, 4909, 4919, 4931, 4933, 4937, 4943, 4951, 4957, 4967, 4969, 4973, 4987, 4993, 4999, 5003, 5009, 5011, 5021, 5023, 5039, 5051, 5059, 5077, 5081, 5087, 5099, 5101, 5107, 5113, 5119, 5147, 5153, 5167, 5171, 5179, 5189, 5197, 5209, 5227, 5231, 5233, 5237, 5261, 5273, 5279, 5281, 5297, 5303, 5309, 5323, 5333, 5347, 5351, 5381, 5387, 5393, 5399, 5407, 5413, 5417, 5419, 5431, 5437, 5441, 5443, 5449, 5471, 5477, 5479, 5483, 5501, 5503, 5507, 5519, 5521, 5527, 5531, 5557, 5563, 5569, 5573, 5581, 5591, 5623, 5639, 5641, 5647, 5651, 5653, 5657, 5659, 5669, 5683, 5689, 5693, 5701, 5711, 5717, 5737, 5741, 5743, 5749, 5779, 5783, 5791, 5801, 5807, 5813, 5821, 5827, 5839, 5843, 5849, 5851, 5857, 5861, 5867, 5869, 5879, 5881, 5897, 5903, 5923, 5927, 5939, 5953, 5981, 5987, 6007, 6011, 6029, 6037, 6043, 6047, 6053, 6067, 6073, 6079, 6089, 6091, 6101, 6113, 6121, 6131, 6133, 6143, 6151, 6163, 6173, 6197, 6199, 6203, 6211, 6217, 6221, 6229, 6247, 6257, 6263, 6269, 6271, 6277, 6287, 6299, 6301, 6311, 6317, 6323, 6329, 6337, 6343, 6353, 6359, 6361, 6367, 6373, 6379, 6389, 6397, 6421, 6427, 6449, 6451, 6469, 6473, 6481, 6491, 6521, 6529, 6547, 6551, 6553, 6563, 6569, 6571, 6577, 6581, 6599, 6607, 6619, 6637, 6653, 6659, 6661, 6673, 6679, 6689, 6691, 6701, 6703, 6709, 6719, 6733, 6737, 6761, 6763, 6779, 6781, 6791, 6793, 6803, 6823, 6827, 6829, 6833, 6841, 6857, 6863, 6869, 6871, 6883, 6899, 6907, 6911, 6917, 6947, 6949, 6959, 6961, 6967, 6971, 6977, 6983, 6991, 6997, 7001, 7013, 7019, 7027, 7039, 7043, 7057, 7069, 7079, 7103, 7109, 7121, 7127, 7129, 7151, 7159, 7177, 7187, 7193, 7207, 7211, 7213, 7219, 7229, 7237, 7243, 7247, 7253, 7283, 7297, 7307, 7309, 7321, 7331, 7333, 7349, 7351, 7369, 7393, 7411, 7417, 7433, 7451, 7457, 7459, 7477, 7481, 7487, 7489, 7499, 7507, 7517, 7523, 7529, 7537, 7541, 7547, 7549, 7559, 7561, 7573, 7577, 7583, 7589, 7591, 7603, 7607, 7621, 7639, 7643, 7649, 7669, 7673, 7681, 7687, 7691, 7699, 7703, 7717, 7723, 7727, 7741, 7753, 7757, 7759, 7789, 7793, 7817, 7823, 7829, 7841, 7853, 7867, 7873, 7877, 7879, 7883, 7901, 7907, 7919, 7927, 7933, 7937, 7949, 7951, 7963, 7993, 8009, 8011, 8017, 8039, 8053, 8059, 8069, 8081, 8087, 8089, 8093, 8101, 8111, 8117, 8123, 8147, 8161, 8167, 8171, 8179, 8191, 8209, 8219, 8221, 8231, 8233, 8237, 8243, 8263, 8269, 8273, 8287, 8291, 8293, 8297, 8311, 8317, 8329, 8353, 8363, 8369, 8377, 8387, 8389, 8419, 8423, 8429, 8431, 8443, 8447, 8461, 8467, 8501, 8513, 8521, 8527, 8537, 8539, 8543, 8563, 8573, 8581, 8597, 8599, 8609, 8623, 8627, 8629, 8641, 8647, 8663, 8669, 8677, 8681, 8689, 8693, 8699, 8707, 8713, 8719, 8731, 8737, 8741, 8747, 8753, 8761, 8779, 8783, 8803, 8807, 8819, 8821, 8831, 8837, 8839, 8849, 8861, 8863, 8867, 8887, 8893, 8923, 8929, 8933, 8941, 8951, 8963, 8969, 8971, 8999, 9001, 9007, 9011, 9013, 9029, 9041, 9043, 9049, 9059, 9067, 9091, 9103, 9109, 9127, 9133, 9137, 9151, 9157, 9161, 9173, 9181, 9187, 9199, 9203, 9209, 9221, 9227, 9239, 9241, 9257, 9277, 9281, 9283, 9293, 9311, 9319, 9323, 9337, 9341, 9343, 9349, 9371, 9377, 9391, 9397, 9403, 9413, 9419, 9421, 9431, 9433, 9437, 9439, 9461, 9463, 9467, 9473, 9479, 9491, 9497, 9511, 9521, 9533, 9539, 9547, 9551, 9587, 9601, 9613, 9619, 9623, 9629, 9631, 9643, 9649, 9661, 9677, 9679, 9689, 9697, 9719, 9721, 9733, 9739, 9743, 9749, 9767, 9769, 9781, 9787, 9791, 9803, 9811, 9817, 9829, 9833, 9839, 9851, 9857, 9859, 9871, 9883, 9887, 9901, 9907, 9923, 9929, 9931, 9941, 9949, 9967, 9973, 10007, 10009, 10037, 10039, 10061, 10067, 10069, 10079, 10091, 10093, 10099, 10103, 10111, 10133, 10139, 10141, 10151, 10159, 10163, 10169, 10177, 10181, 10193, 10211, 10223, 10243, 10247, 10253, 10259, 10267, 10271, 10273, 10289, 10301, 10303, 10313, 10321, 10331, 10333, 10337, 10343, 10357, 10369, 10391, 10399, 10427, 10429, 10433, 10453, 10457, 10459, 10463, 10477, 10487, 10499, 10501, 10513, 10529, 10531, 10559, 10567, 10589, 10597, 10601, 10607, 10613, 10627, 10631, 10639, 10651, 10657, 10663, 10667, 10687, 10691, 10709, 10711, 10723, 10729, 10733, 10739, 10753, 10771, 10781, 10789, 10799, 10831, 10837, 10847, 10853, 10859, 10861, 10867, 10883, 10889, 10891, 10903, 10909, 10937, 10939, 10949, 10957, 10973, 10979, 10987, 10993, 11003, 11027, 11047, 11057, 11059, 11069, 11071, 11083, 11087, 11093, 11113, 11117, 11119, 11131, 11149, 11159, 11161, 11171, 11173, 11177, 11197, 11213, 11239, 11243, 11251, 11257, 11261, 11273, 11279, 11287, 11299, 11311, 11317, 11321, 11329, 11351, 11353, 11369, 11383, 11393, 11399, 11411, 11423, 11437, 11443, 11447, 11467, 11471, 11483, 11489, 11491, 11497, 11503, 11519, 11527, 11549, 11551, 11579, 11587, 11593, 11597, 11617, 11621, 11633, 11657, 11677, 11681, 11689, 11699, 11701, 11717, 11719, 11731, 11743, 11777, 11779, 11783, 11789, 11801, 11807, 11813, 11821, 11827, 11831, 11833, 11839, 11863, 11867, 11887, 11897, 11903, 11909, 11923, 11927, 11933, 11939, 11941, 11953, 11959, 11969, 11971, 11981, 11987, 12007, 12011, 12037, 12041, 12043, 12049, 12071, 12073, 12097, 12101, 12107, 12109, 12113, 12119, 12143, 12149, 12157, 12161, 12163, 12197, 12203, 12211, 12227, 12239, 12241, 12251, 12253, 12263, 12269, 12277, 12281, 12289, 12301, 12323, 12329, 12343, 12347, 12373, 12377, 12379, 12391, 12401, 12409, 12413, 12421, 12433, 12437, 12451, 12457, 12473, 12479, 12487, 12491, 12497, 12503, 12511, 12517, 12527, 12539, 12541, 12547, 12553, 12569, 12577, 12583, 12589, 12601, 12611, 12613, 12619, 12637, 12641, 12647, 12653, 12659, 12671, 12689, 12697, 12703, 12713, 12721, 12739, 12743, 12757, 12763, 12781, 12791, 12799, 12809, 12821, 12823, 12829, 12841, 12853, 12889, 12893, 12899, 12907, 12911, 12917, 12919, 12923, 12941, 12953, 12959, 12967, 12973, 12979, 12983, 13001, 13003, 13007, 13009, 13033, 13037, 13043, 13049, 13063, 13093, 13099, 13103, 13109, 13121, 13127, 13147, 13151, 13159, 13163, 13171, 13177, 13183, 13187, 13217, 13219, 13229, 13241, 13249, 13259, 13267, 13291, 13297, 13309, 13313, 13327, 13331, 13337, 13339, 13367, 13381, 13397, 13399, 13411, 13417, 13421, 13441, 13451, 13457, 13463, 13469, 13477, 13487, 13499, 13513, 13523, 13537, 13553, 13567, 13577, 13591, 13597, 13613, 13619, 13627, 13633, 13649, 13669, 13679, 13681, 13687, 13691, 13693, 13697, 13709, 13711, 13721, 13723, 13729, 13751, 13757, 13759, 13763, 13781, 13789, 13799, 13807, 13829, 13831, 13841, 13859, 13873, 13877, 13879, 13883, 13901, 13903, 13907, 13913, 13921, 13931, 13933, 13963, 13967, 13997, 13999, 14009, 14011, 14029, 14033, 14051, 14057, 14071, 14081, 14083, 14087, 14107, 14143, 14149, 14153, 14159, 14173, 14177, 14197, 14207, 14221, 14243, 14249, 14251, 14281, 14293, 14303, 14321, 14323, 14327, 14341, 14347, 14369, 14387, 14389, 14401, 14407, 14411, 14419, 14423, 14431, 14437, 14447, 14449, 14461, 14479, 14489, 14503, 14519, 14533, 14537, 14543, 14549, 14551, 14557, 14561, 14563, 14591, 14593, 14621, 14627, 14629, 14633, 14639, 14653, 14657, 14669, 14683, 14699, 14713, 14717, 14723, 14731, 14737, 14741, 14747, 14753, 14759, 14767, 14771, 14779, 14783, 14797, 14813, 14821, 14827, 14831, 14843, 14851, 14867, 14869, 14879, 14887, 14891, 14897, 14923, 14929, 14939, 14947, 14951, 14957, 14969, 14983]
n = int(input())
if n == 2:
	print(-1)
	exit(0)
a = [2] * n
a[n - 1] = 1
last = 1
for i in range(n - 1):
	a[i] *= p[last]
	a[n - 1] *= p[last]
	last += 1
for i in a:
	print(i)


def isPrime(n):
	i = 2
	while i * i <= n:
		if n % i == 0:
			return 0
		i += 1
	return n > 1
m = int(input())
if m == 2:
	print(-1)
	exit(0)
i = 2
primes = []
while len(primes) <= m + 1:
	if isPrime(i):
		primes.append(i)
	i += 1
p = 1
for j in range(0, m - 1):
	print(primes[j] * primes[m])
	p *= primes[j]
print(p * primes[m - 1])


import math
import functools
prime_list = [2, 3]

def sieve(primes_no):
	p = 5
	while len(prime_list) < primes_no:
		isprime = True
		for q in range(3, int(math.sqrt(p)) + 1, 2):
			if p % q == 0:
				isprime = False
				break
		if isprime == True:
			prime_list.append(p)
		p += 2

def main():
	n = int(input())
	if n == 2:
		print('-1')
		exit()
	sieve(n)
	for i in range(n):
		print(functools.reduce(lambda x, y: x * y, prime_list[:i] + prime_list[i + 1:], 1))
main()


import math
import itertools
import collections

def getdict(n):
	d = {}
	if type(n) is list or type(n) is str:
		for i in n:
			if i in d:
				d[i] += 1
			else:
				d[i] = 1
	else:
		for i in range(n):
			t = ii()
			if t in d:
				d[t] += 1
			else:
				d[t] = 1
	return d

def cdiv(n, k):
	return n // k + (n % k != 0)

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(map(int, input().split()))

def lcm(a, b):
	return abs(a * b) // math.gcd(a, b)

def wr(arr):
	return ' '.join(map(str, arr))

def prime(n):
	if n == 2:
		return True
	if n % 2 == 0 or n <= 1:
		return False
	sqr = int(math.sqrt(n)) + 1
	for d in range(3, sqr, 2):
		if n % d == 0:
			return False
	return True

def revn(n):
	m = 0
	while n > 0:
		m = m * 10 + n % 10
		n = n // 10
	return m
n = ii()
primes = [2]
if n == 2:
	print(-1)
else:
	i = 1
	p = 3
	while i < n:
		if prime(p):
			primes.append(p)
			i += 1
		p += 2
	mp = 1
	for p in primes:
		mp *= p
	for p in primes:
		print(mp // p)


p = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293]
n = int(input())
if n == 2:
	exit(print(-1))
a = [1] * n
i = j = 0
while i < n - 1:
	a[i] *= p[i] * p[i + 1]
	a[i + 1] *= p[i + 1] * p[i + 2]
	for k in range(i + 2, n):
		a[k] *= p[i] * p[i + 2]
	i += 2
	j += 3
print(*a, sep='\n')


import math as m
n = int(input())
if n == 2:
	print(-1)
	exit(0)
primes = []
i = 2
while len(primes) < n:
	flag = 1
	for j in range(2, i):
		if i % j == 0:
			flag = 0
	if flag == 1:
		primes.append(i)
	i += 1
product = 1
for i in primes:
	product *= i
for i in primes:
	print(product // i)


import sys
from array import array

def input():
	return sys.stdin.buffer.readline().decode('utf-8')
n = int(input())
if n == 2:
	print(-1)
	exit()
a = [1] * n
a[0] = 10
a[1] = 15
for i in range(2, n):
	a[i] = 2 ** i * 3
print(*a, sep='\n')


def make_prime():
	prime = []
	vis = [False for i in range(1000000)]
	vis[1] = True
	cnt = 0
	for i in range(2, 1000000):
		if vis[i] == False:
			cnt = cnt + 1
			prime.append(i)
			if cnt == 100:
				return prime
			for j in range(i, 1000000, i):
				vis[j] = True
n = int(input())
if n == 2:
	print(-1)
	exit()
if n == 1:
	print(1)
	exit()
prime = make_prime()
arr = [1 for i in range(n + 2)]
for i in range(n):
	for j in range(n):
		if i == j:
			continue
		arr[i] *= prime[j]
for i in range(n):
	print(arr[i])


st = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, 337, 347, 349, 353, 359, 367, 373, 379, 383, 389, 397]
n = int(input())
arr = []
x = 1
for i in range(n - 1):
	arr.append(2 * st[i + 1])
	x = x * st[i + 1]
arr.append(x * st[n + 1])
if n > 2:
	for x in arr:
		print(x)
else:
	print(-1)


n = int(input())
if n == 2:
	print(-1)
else:
	isPrime = [True] * 301
	primes = []
	for i in range(2, 300):
		if isPrime[i]:
			for j in range(i * i, 300, i):
				isPrime[j] = False
			primes.append(i)
	primes = primes[1:]
	for i in range(n - 1):
		print(2 * primes[i])
	tot = 1
	for i in range(n - 1):
		tot *= primes[i]
	print(tot)


def prime1(n):
	flag = 0
	for i in range(2, n // 2 + 1):
		if n % i == 0:
			flag = 1
			break
	if flag == 1:
		return 0
	else:
		return 1
n = int(input(''))
a = list()
if n == 2:
	print('-1')
else:
	count = 0
	i = 2
	while count != n:
		k = prime1(i)
		if k == 1:
			a.append(i)
			count += 1
		i += 1
	m = 1
	for i in range(0, n):
		m = m * a[i]
	for i in range(0, n):
		temp = m // a[i]
		print(temp)


def main():
	n = int(input())
	if n == 2:
		print(-1)
		return
	primes = []
	for i in range(2, 10000):
		ok = True
		for j in range(2, i):
			if j * j > i:
				break
			if i % j == 0:
				ok = False
				break
		if ok:
			primes.append(i)
		if len(primes) == n:
			break
	for i in range(n):
		x = 1
		for j in range(n):
			if i == j:
				continue
			x *= primes[j]
		print(x)
main()


n = int(input())
if n == 2:
	print(-1)
	exit(0)
p = 2

def easy(x):
	i = 2
	while i * i <= x:
		if x % i == 0:
			return 0
		i += 1
	return 1

def nxt():
	global p
	p += 1
	while easy(p) == 0:
		p += 1
	return p
ans = [2 for _ in range(n)]
ans[n - 1] = 1
for i in range(n - 1):
	x = nxt()
	ans[i] *= x
	ans[n - 1] *= x
for i in range(n):
	print(ans[i])


PMAX = 300
isPrime = [False for i in range(PMAX)]
for i in range(2, PMAX):
	isPrime[i] = True
for i in range(2, PMAX):
	if isPrime[i]:
		for j in range(2 * i, PMAX, i):
			isPrime[j] = False
n = int(input())
primeToTake = [p for p in range(PMAX) if isPrime[p]][:n]
product = 1
for x in primeToTake:
	product *= x
if n == 2:
	print(-1)
else:
	print(*[product // p for p in primeToTake], sep='\n')


l = [1 for i in range(1001)]
l[0] = 0
l[1] = 0
i = 2
while i * i <= 1000:
	if l[i]:
		j = i * i
		while j <= 1000:
			l[j] = 0
			j += i
	i += 1
arrofprimes = []
for i in range(1000):
	if l[i]:
		arrofprimes.append(i)
n = int(input())
if n == 2:
	print(-1)
else:
	propi = 1
	for i in range(n):
		propi *= arrofprimes[i]
	for i in range(n):
		print(propi // arrofprimes[i])


import math
n = int(input())
if n == 2:
	print(-1)
else:
	k = 1
	for i in range(1, n + 1):
		if i == 1:
			print(30)
		elif i == n:
			print(5 * 7 * 13)
		else:
			print(3 ** k * 7)
			k += 1


import os
import sys
from math import *
from collections import *
from bisect import *
from io import BytesIO, IOBase

def vsInput():
	sys.stdin = open('input.txt', 'r')
	sys.stdout = open('output.txt', 'w')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
ALPHA = 'abcdefghijklmnopqrstuvwxyz'
M = 10 ** 9 + 7
EPS = 1e-06

def Ceil(a, b):
	return a // b + int(a % b > 0)

def value():
	return tuple(map(int, input().split()))

def array():
	return [int(i) for i in input().split()]

def Int():
	return int(input())

def Str():
	return input()

def arrayS():
	return [i for i in input().split()]

def GCD(a):
	gc = a[0]
	for i in a[1:]:
		gc = gcd(gc, i)
	return gc
n = Int()
a = [6, 14, 21]
for i in range(2, n):
	a.append(6 * i)
if n == 2:
	print(-1)
else:
	for i in range(n):
		print(a[i])


a = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229]

def petya_friends(n):
	if n == 2:
		return [-1]
	else:
		(s, result) = (1, list())
		for i in range(n):
			s *= a[i]
		for i in range(n):
			result.append(s // a[i])
	return result
print(*petya_friends(int(input())), sep='\n')


n = int(input())
if n == 2:
	print(-1)
	exit()
print(6)
print(10)
print(15)
l = 15
for i in range(3, n):
	l *= 2
	print(l)


import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
from collections import defaultdict
mod = 10 ** 9 + 7
mod1 = 998244353
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class TreeNode:

	def __init__(self, k, v):
		self.key = k
		self.value = v
		self.left = None
		self.right = None
		self.parent = None
		self.height = 1
		self.num_left = 1
		self.num_total = 1

class AvlTree:

	def __init__(self):
		self._tree = None

	def add(self, k, v):
		if not self._tree:
			self._tree = TreeNode(k, v)
			return
		node = self._add(k, v)
		if node:
			self._rebalance(node)

	def _add(self, k, v):
		node = self._tree
		while node:
			if k < node.key:
				if node.left:
					node = node.left
				else:
					node.left = TreeNode(k, v)
					node.left.parent = node
					return node.left
			elif node.key < k:
				if node.right:
					node = node.right
				else:
					node.right = TreeNode(k, v)
					node.right.parent = node
					return node.right
			else:
				node.value = v
				return

	@staticmethod
	def get_height(x):
		return x.height if x else 0

	@staticmethod
	def get_num_total(x):
		return x.num_total if x else 0

	def _rebalance(self, node):
		n = node
		while n:
			lh = self.get_height(n.left)
			rh = self.get_height(n.right)
			n.height = max(lh, rh) + 1
			balance_factor = lh - rh
			n.num_total = 1 + self.get_num_total(n.left) + self.get_num_total(n.right)
			n.num_left = 1 + self.get_num_total(n.left)
			if balance_factor > 1:
				if self.get_height(n.left.left) < self.get_height(n.left.right):
					self._rotate_left(n.left)
				self._rotate_right(n)
			elif balance_factor < -1:
				if self.get_height(n.right.right) < self.get_height(n.right.left):
					self._rotate_right(n.right)
				self._rotate_left(n)
			else:
				n = n.parent

	def _remove_one(self, node):
		replacement = node.left or node.right
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = replacement
			else:
				node.parent.right = replacement
			replacement.parent = node.parent
			node.parent = None
		else:
			self._tree = replacement
			replacement.parent = None
		node.left = None
		node.right = None
		node.parent = None
		self._rebalance(replacement)

	def _remove_leaf(self, node):
		if node.parent:
			if AvlTree._is_left(node):
				node.parent.left = None
			else:
				node.parent.right = None
			self._rebalance(node.parent)
		else:
			self._tree = None
		node.parent = None
		node.left = None
		node.right = None

	def remove(self, k):
		node = self._get_node(k)
		if not node:
			return
		if AvlTree._is_leaf(node):
			self._remove_leaf(node)
			return
		if node.left and node.right:
			nxt = AvlTree._get_next(node)
			node.key = nxt.key
			node.value = nxt.value
			if self._is_leaf(nxt):
				self._remove_leaf(nxt)
			else:
				self._remove_one(nxt)
			self._rebalance(node)
		else:
			self._remove_one(node)

	def get(self, k):
		node = self._get_node(k)
		return node.value if node else -1

	def _get_node(self, k):
		if not self._tree:
			return None
		node = self._tree
		while node:
			if k < node.key:
				node = node.left
			elif node.key < k:
				node = node.right
			else:
				return node
		return None

	def get_at(self, pos):
		x = pos + 1
		node = self._tree
		while node:
			if x < node.num_left:
				node = node.left
			elif node.num_left < x:
				x -= node.num_left
				node = node.right
			else:
				return (node.key, node.value)
		raise IndexError('Out of ranges')

	@staticmethod
	def _is_left(node):
		return node.parent.left and node.parent.left == node

	@staticmethod
	def _is_leaf(node):
		return node.left is None and node.right is None

	def _rotate_right(self, node):
		if not node.parent:
			self._tree = node.left
			node.left.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.left
			node.left.parent = node.parent
		else:
			node.parent.right = node.left
			node.left.parent = node.parent
		bk = node.left.right
		node.left.right = node
		node.parent = node.left
		node.left = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	def _rotate_left(self, node):
		if not node.parent:
			self._tree = node.right
			node.right.parent = None
		elif AvlTree._is_left(node):
			node.parent.left = node.right
			node.right.parent = node.parent
		else:
			node.parent.right = node.right
			node.right.parent = node.parent
		bk = node.right.left
		node.right.left = node
		node.parent = node.right
		node.right = bk
		if bk:
			bk.parent = node
		node.height = max(self.get_height(node.left), self.get_height(node.right)) + 1
		node.num_total = 1 + self.get_num_total(node.left) + self.get_num_total(node.right)
		node.num_left = 1 + self.get_num_total(node.left)

	@staticmethod
	def _get_next(node):
		if not node.right:
			return node.parent
		n = node.right
		while n.left:
			n = n.left
		return n

class SegmentTree1:

	def __init__(self, data, default=0, func=lambda a, b: max(a, b)):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class SegmentTree:

	def __init__(self, data, default=0, func=lambda a, b: a + b):
		self._default = default
		self._func = func
		self._len = len(data)
		self._size = _size = 1 << (self._len - 1).bit_length()
		self.data = [default] * (2 * _size)
		self.data[_size:_size + self._len] = data
		for i in reversed(range(_size)):
			self.data[i] = func(self.data[i + i], self.data[i + i + 1])

	def __delitem__(self, idx):
		self[idx] = self._default

	def __getitem__(self, idx):
		return self.data[idx + self._size]

	def __setitem__(self, idx, value):
		idx += self._size
		self.data[idx] = value
		idx >>= 1
		while idx:
			self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])
			idx >>= 1

	def __len__(self):
		return self._len

	def query(self, start, stop):
		if start == stop:
			return self.__getitem__(start)
		stop += 1
		start += self._size
		stop += self._size
		res = self._default
		while start < stop:
			if start & 1:
				res = self._func(res, self.data[start])
				start += 1
			if stop & 1:
				stop -= 1
				res = self._func(res, self.data[stop])
			start >>= 1
			stop >>= 1
		return res

	def __repr__(self):
		return 'SegmentTree({0})'.format(self.data)

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD

def powm(a, n, m):
	if a == 1 or n == 0:
		return 1
	if n % 2 == 0:
		s = powm(a, n // 2, m)
		return s * s % m
	else:
		return a * powm(a, n - 1, m) % m

def sort_list(list1, list2):
	zipped_pairs = zip(list2, list1)
	z = [x for (_, x) in sorted(zipped_pairs)]
	return z

def product(l):
	por = 1
	for i in range(len(l)):
		por *= l[i]
	return por

def binarySearchCount(arr, n, key):
	left = 0
	right = n - 1
	count = 0
	while left <= right:
		mid = int((right + left) / 2)
		if arr[mid] < key:
			count = mid + 1
			left = mid + 1
		else:
			right = mid - 1
	return count

def countdig(n):
	c = 0
	while n > 0:
		n //= 10
		c += 1
	return c

def binary(x, length):
	y = bin(x)[2:]
	return y if len(y) >= length else '0' * (length - len(y)) + y

def countGreater(arr, n, k):
	l = 0
	r = n - 1
	leftGreater = n
	while l <= r:
		m = int(l + (r - l) / 2)
		if arr[m] >= k:
			leftGreater = m
			r = m - 1
		else:
			l = m + 1
	return n - leftGreater
prime = [1] * (10 ** 4 + 1)
tot = []
for i in range(2, 10 ** 3 + 1):
	if prime[i] == 1:
		tot.append(i)
	for j in range(i * i, 10 ** 3 + 1, i):
		prime[j] = 0
n = int(input())
if n == 2:
	print(-1)
	sys.exit(0)
tot = tot[:2 * n + 1]
ans = 1
for i in range(n):
	ans *= tot[i]
for i in range(n):
	ans //= tot[i]
	print(ans)
	ans *= tot[i]


def prim(n):
	if n == 2:
		return True
	if n == 1:
		return False
	for i in range(2, int(n ** 0.5 + 1)):
		if n % i == 0:
			return False
	return True
a = 50
lst = []
num = 2
while a:
	if prim(num):
		lst.append(num)
		num += 1
		a -= 1
	else:
		num += 1
n = int(input())
if n == 1:
	print(2)
	quit()
if n == 2:
	print(-1)
	quit()
top = 1
for i in range(n):
	top *= lst[i]
for i in range(n):
	print(top // lst[i])


n = int(input())
if n == 2:
	print(-1)
	exit()
prms = []
j = 0

def isprime(n):
	return all((n % i for i in range(2, int(n ** 0.5) + 1)))
for i in range(2, 10000):
	if isprime(i):
		prms.append(i)
ans = [0] * 100
ans[0:3] = [15, 10, 6]
for i in range(3, 100):
	ans[i] = 6 * prms[j]
	j += 1
print(*ans[0:n], sep='\n')


primes = [0] * 55

def generatePrimes(n):
	p = [True] * (n + 1)
	p[0] = p[1] = False
	i = 2
	while i * i <= n:
		if p[i]:
			j = i * i
			while j <= n:
				p[j] = False
				j = j + i
		i = i + 1
	i = 2
	idx = 0
	while i <= n:
		if p[i]:
			primes[idx] = i
			idx = idx + 1
		i = i + 1
n = int(input().strip())
if n == 2:
	print(-1)
	quit()
generatePrimes(250)
primeIdx = 0
a = [1] * 55
for i in range(0, n):
	for j in range(0, n):
		if i != j:
			a[j] = a[j] * primes[primeIdx]
	primeIdx = primeIdx + 1
for i in range(0, n):
	print(a[i])


def countdigits(n):
	cnt = 0
	while n:
		cnt += 1
		n //= 10
	return cnt
primes = []
primesize = 230
notprime = [0 for i in range(0, primesize + 1)]
notprime[0] = notprime[1] = 1
for i in range(2, primesize + 1):
	if notprime[i] == 0:
		primes.append(i)
		if len(primes) == 50:
			break
		for j in range(i + i, primesize + 1, i):
			notprime[j] += 1
n = int(input())
if n == 2:
	print(-1)
else:
	ans = 1
	for i in range(0, n):
		ans *= primes[i]
	for i in range(0, n):
		print(ans // primes[n - i - 1])


a = int(input())
if a == 2:
	print(-1)
	exit(0)
v = []
for i in range(2, 1000):
	if i < 4:
		v.append(i)
		continue
	p = 0
	for z in range(2, i):
		if i != z and i % z == 0:
			p = 1
			break
	if p != 0:
		continue
	v.append(i)
c = 1
for i in range(a):
	c *= v[i]
k = []
for i in range(a):
	print(int(c // v[i]))


def check(x):
	i = 2
	while i * i <= x:
		if x % i == 0:
			return 0
		else:
			i = i + 1
	return 1

def main():
	n = int(input())
	if n == 2:
		print(-1)
		exit(0)
	acc = 1
	(i, cnt) = (3, 1)
	while cnt < n:
		if check(i):
			print(2 * i)
			acc *= i
			cnt += 1
		i += 1
	print(acc)
main()


import math
n = int(input())
prime = []
if n == 1:
	print(2)
	exit()
if n == 2:
	print(-1)
	exit()
if n == 3:
	print(99)
	print(55)
	print(11115)
	exit()
x = 1
for i in range(n):
	flag = 0
	while flag == 0:
		x = x + 1
		status = 0
		for j in range(2, x // 2 + 1):
			if x % j == 0:
				status = 1
				break
		if status == 0:
			prime.append(x)
			flag = 1
ans = []
ans.append(2 * 3 * prime[len(prime) - 1])
for i in range(1, len(prime) - 1):
	ans.append(3 * 5 * prime[i])
ans.append(prime[len(prime) - 1] * 5)
for x in ans:
	print(x)


from sys import stdin, stdout
s = int(stdin.readline())
gg = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229]
rr = [1] * s
if s == 2:
	stdout.write('-1')
else:
	j = 0
	for k in range(s):
		for i in range(s):
			if i != j:
				rr[i] *= gg[k]
		j += 1
	for i in range(s):
		stdout.write(str(rr[i]) + '\n')


import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
from collections import deque
import threading
threading.stack_size(10 ** 8)
sys.setrecursionlimit(300000)
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

class Factorial:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorials = [1, 1]
		self.invModulos = [0, 1]
		self.invFactorial_ = [1, 1]

	def calc(self, n):
		if n <= -1:
			print('Invalid argument to calculate n!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.factorials):
			return self.factorials[n]
		nextArr = [0] * (n + 1 - len(self.factorials))
		initialI = len(self.factorials)
		prev = self.factorials[-1]
		m = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * i % m
		self.factorials += nextArr
		return self.factorials[n]

	def inv(self, n):
		if n <= -1:
			print('Invalid argument to calculate n^(-1)')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		p = self.MOD
		pi = n % p
		if pi < len(self.invModulos):
			return self.invModulos[pi]
		nextArr = [0] * (n + 1 - len(self.invModulos))
		initialI = len(self.invModulos)
		for i in range(initialI, min(p, n + 1)):
			next = -self.invModulos[p % i] * (p // i) % p
			self.invModulos.append(next)
		return self.invModulos[pi]

	def invFactorial(self, n):
		if n <= -1:
			print('Invalid argument to calculate (n^(-1))!')
			print('n must be non-negative value. But the argument was ' + str(n))
			exit()
		if n < len(self.invFactorial_):
			return self.invFactorial_[n]
		self.inv(n)
		nextArr = [0] * (n + 1 - len(self.invFactorial_))
		initialI = len(self.invFactorial_)
		prev = self.invFactorial_[-1]
		p = self.MOD
		for i in range(initialI, n + 1):
			prev = nextArr[i - initialI] = prev * self.invModulos[i % p] % p
		self.invFactorial_ += nextArr
		return self.invFactorial_[n]

class Combination:

	def __init__(self, MOD):
		self.MOD = MOD
		self.factorial = Factorial(MOD)

	def ncr(self, n, k):
		if k < 0 or n < k:
			return 0
		k = min(k, n - k)
		f = self.factorial
		return f.calc(n) * f.invFactorial(max(n - k, k)) * f.invFactorial(min(k, n - k)) % self.MOD
mod = 10 ** 9 + 7
n = int(input())
c = 1
a = [2]
el = 3
p = 2
if n == 2:
	print(-1)
	sys.exit(0)
while c < n:
	num = el
	d = 0
	for i in range(2, int(math.sqrt(num)) + 1):
		if num % i == 0:
			d += 1
	if d == 0:
		a.append(num)
		c += 1
		p *= num
	el += 2
for i in range(n):
	print(p // a[i])


n = int(input())
if n == 2:
	print(-1)
	exit()
primes = [2]
while len(primes) < n * (n - 1) // 2:
	i = primes[-1] + 1
	while True:
		d = 1
		for j in primes:
			if i % j == 0:
				d = 0
				break
		if d:
			primes.append(i)
			i += 1
			break
		i += 1
ans = [1] * n
p = 0
con = [[0] * n] * n
for i in range(n):
	j = (i + 2) % n
	ans[i] *= primes[p]
	while j != i:
		con[i][j] = 1
		ans[j] *= primes[p]
		j = (j + 1) % n
	p += 1
for i in ans:
	print(i)


n = int(input().strip())
if n == 2:
	print(-1)
	exit(0)
ans = []
num = 1
for i in range(n - 1):
	num *= 2
	ans.append(num * 3)
ans[n - 2] //= 3
ans[n - 2] *= 5
ans.append(15)
for i in ans:
	print(i)


from sys import stdin, stdout
n = int(stdin.readline())
challengers = list(map(int, ['2', '3', '5', '7', '11', '13', '17', '19', '23', '29', '31', '37', '41', '43', '47', '53', '59', '61', '67', '71', '73', '79', '83', '89', '97', '101', '103', '107', '109', '113', '127', '131', '137', '139', '149', '151', '157', '163', '167', '173', '179', '181', '191', '193', '197', '199', '211', '223', '227', '229']))
ans = []
for i in range(1, n):
	ans.append(challengers[0] * challengers[i])
ans.append(1)
for i in range(1, n):
	ans[-1] *= challengers[i]
if n == 2:
	stdout.write('-1')
else:
	stdout.write('\n'.join(list(map(str, ans))))

def gcd(a, b):
	if not b:
		return a
	else:
		return gcd(b, a % b)


x = int(input())
if x < 3:
	print(-1)
	exit(0)
siv = [1] * 300
siv[0] = siv[1] = 0
for n in range(2, 300):
	if siv[n]:
		for k in range(n * n, 300, n):
			siv[k] = 0
pr = []
for n in range(2, 300):
	if siv[n]:
		pr.append(n)
sol = [2] * (x - 1) + [3]
sol[0] *= 3
cur = 3
for n in range(1, x):
	sol[n] *= 5
	if n >= 2:
		sol[n] *= pr[cur]
		cur += 1
for n in sol:
	print(n)


import sys
from math import gcd, sqrt, ceil, log2
from collections import defaultdict, Counter, deque
from bisect import bisect_left, bisect_right
import math
sys.setrecursionlimit(2 * 10 ** 5 + 10)
import heapq
from itertools import permutations
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
aa = 'abcdefghijklmnopqrstuvwxyz'

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')
(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')

def get_sum(bit, i):
	s = 0
	i += 1
	while i > 0:
		s += bit[i]
		i -= i & -i
	return s

def update(bit, n, i, v):
	i += 1
	while i <= n:
		bit[i] += v
		i += i & -i

def modInverse(b, m):
	g = math.gcd(b, m)
	if g != 1:
		return -1
	else:
		return pow(b, m - 2, m)

def primeFactors(n):
	sa = []
	while n % 2 == 0:
		sa.append(2)
		n = n // 2
	for i in range(3, int(math.sqrt(n)) + 1, 2):
		while n % i == 0:
			sa.append(i)
			n = n // i
	if n > 2:
		sa.append(n)
	return sa

def seive(n):
	pri = [True] * (n + 1)
	p = 2
	while p * p <= n:
		if pri[p] == True:
			for i in range(p * p, n + 1, p):
				pri[i] = False
		p += 1
	return pri

def check_prim(n):
	if n < 0:
		return False
	for i in range(2, int(sqrt(n)) + 1):
		if n % i == 0:
			return False
	return True

def getZarr(string, z):
	n = len(string)
	(l, r, k) = (0, 0, 0)
	for i in range(1, n):
		if i > r:
			(l, r) = (i, i)
			while r < n and string[r - l] == string[r]:
				r += 1
			z[i] = r - l
			r -= 1
		else:
			k = i - l
			if z[k] < r - i + 1:
				z[i] = z[k]
			else:
				l = i
				while r < n and string[r - l] == string[r]:
					r += 1
				z[i] = r - l
				r -= 1

def search(text, pattern):
	concat = pattern + '$' + text
	l = len(concat)
	z = [0] * l
	getZarr(concat, z)
	ha = []
	for i in range(l):
		if z[i] == len(pattern):
			ha.append(i - len(pattern) - 1)
	return ha

def mergeIntervals(arr):
	arr.sort(key=lambda x: x[0])
	m = []
	s = -10000
	max = -100000
	for i in range(len(arr)):
		a = arr[i]
		if a[0] > max:
			if i != 0:
				m.append([s, max])
			max = a[1]
			s = a[0]
		elif a[1] >= max:
			max = a[1]
	if max != -100000 and [s, max] not in m:
		m.append([s, max])
	return m

class SortedList:

	def __init__(self, iterable=[], _load=200):
		values = sorted(iterable)
		self._len = _len = len(values)
		self._load = _load
		self._lists = _lists = [values[i:i + _load] for i in range(0, _len, _load)]
		self._list_lens = [len(_list) for _list in _lists]
		self._mins = [_list[0] for _list in _lists]
		self._fen_tree = []
		self._rebuild = True

	def _fen_build(self):
		self._fen_tree[:] = self._list_lens
		_fen_tree = self._fen_tree
		for i in range(len(_fen_tree)):
			if i | i + 1 < len(_fen_tree):
				_fen_tree[i | i + 1] += _fen_tree[i]
		self._rebuild = False

	def _fen_update(self, index, value):
		if not self._rebuild:
			_fen_tree = self._fen_tree
			while index < len(_fen_tree):
				_fen_tree[index] += value
				index |= index + 1

	def _fen_query(self, end):
		if self._rebuild:
			self._fen_build()
		_fen_tree = self._fen_tree
		x = 0
		while end:
			x += _fen_tree[end - 1]
			end &= end - 1
		return x

	def _fen_findkth(self, k):
		_list_lens = self._list_lens
		if k < _list_lens[0]:
			return (0, k)
		if k >= self._len - _list_lens[-1]:
			return (len(_list_lens) - 1, k + _list_lens[-1] - self._len)
		if self._rebuild:
			self._fen_build()
		_fen_tree = self._fen_tree
		idx = -1
		for d in reversed(range(len(_fen_tree).bit_length())):
			right_idx = idx + (1 << d)
			if right_idx < len(_fen_tree) and k >= _fen_tree[right_idx]:
				idx = right_idx
				k -= _fen_tree[idx]
		return (idx + 1, k)

	def _delete(self, pos, idx):
		_lists = self._lists
		_mins = self._mins
		_list_lens = self._list_lens
		self._len -= 1
		self._fen_update(pos, -1)
		del _lists[pos][idx]
		_list_lens[pos] -= 1
		if _list_lens[pos]:
			_mins[pos] = _lists[pos][0]
		else:
			del _lists[pos]
			del _list_lens[pos]
			del _mins[pos]
			self._rebuild = True

	def _loc_left(self, value):
		if not self._len:
			return (0, 0)
		_lists = self._lists
		_mins = self._mins
		(lo, pos) = (-1, len(_lists) - 1)
		while lo + 1 < pos:
			mi = lo + pos >> 1
			if value <= _mins[mi]:
				pos = mi
			else:
				lo = mi
		if pos and value <= _lists[pos - 1][-1]:
			pos -= 1
		_list = _lists[pos]
		(lo, idx) = (-1, len(_list))
		while lo + 1 < idx:
			mi = lo + idx >> 1
			if value <= _list[mi]:
				idx = mi
			else:
				lo = mi
		return (pos, idx)

	def _loc_right(self, value):
		if not self._len:
			return (0, 0)
		_lists = self._lists
		_mins = self._mins
		(pos, hi) = (0, len(_lists))
		while pos + 1 < hi:
			mi = pos + hi >> 1
			if value < _mins[mi]:
				hi = mi
			else:
				pos = mi
		_list = _lists[pos]
		(lo, idx) = (-1, len(_list))
		while lo + 1 < idx:
			mi = lo + idx >> 1
			if value < _list[mi]:
				idx = mi
			else:
				lo = mi
		return (pos, idx)

	def add(self, value):
		_load = self._load
		_lists = self._lists
		_mins = self._mins
		_list_lens = self._list_lens
		self._len += 1
		if _lists:
			(pos, idx) = self._loc_right(value)
			self._fen_update(pos, 1)
			_list = _lists[pos]
			_list.insert(idx, value)
			_list_lens[pos] += 1
			_mins[pos] = _list[0]
			if _load + _load < len(_list):
				_lists.insert(pos + 1, _list[_load:])
				_list_lens.insert(pos + 1, len(_list) - _load)
				_mins.insert(pos + 1, _list[_load])
				_list_lens[pos] = _load
				del _list[_load:]
				self._rebuild = True
		else:
			_lists.append([value])
			_mins.append(value)
			_list_lens.append(1)
			self._rebuild = True

	def discard(self, value):
		_lists = self._lists
		if _lists:
			(pos, idx) = self._loc_right(value)
			if idx and _lists[pos][idx - 1] == value:
				self._delete(pos, idx - 1)

	def remove(self, value):
		_len = self._len
		self.discard(value)
		if _len == self._len:
			raise ValueError('{0!r} not in list'.format(value))

	def pop(self, index=-1):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		value = self._lists[pos][idx]
		self._delete(pos, idx)
		return value

	def bisect_left(self, value):
		(pos, idx) = self._loc_left(value)
		return self._fen_query(pos) + idx

	def bisect_right(self, value):
		(pos, idx) = self._loc_right(value)
		return self._fen_query(pos) + idx

	def count(self, value):
		return self.bisect_right(value) - self.bisect_left(value)

	def __len__(self):
		return self._len

	def __getitem__(self, index):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		return self._lists[pos][idx]

	def __delitem__(self, index):
		(pos, idx) = self._fen_findkth(self._len + index if index < 0 else index)
		self._delete(pos, idx)

	def __contains__(self, value):
		_lists = self._lists
		if _lists:
			(pos, idx) = self._loc_left(value)
			return idx < len(_lists[pos]) and _lists[pos][idx] == value
		return False

	def __iter__(self):
		return (value for _list in self._lists for value in _list)

	def __reversed__(self):
		return (value for _list in reversed(self._lists) for value in reversed(_list))

	def __repr__(self):
		return 'SortedList({0})'.format(list(self))

def ncr(n, r, p):
	num = den = 1
	for i in range(r):
		num = num * (n - i) % p
		den = den * (i + 1) % p
	return num * pow(den, p - 2, p) % p

def sol(n):
	seti = set()
	for i in range(1, int(sqrt(n)) + 1):
		if n % i == 0:
			seti.add(n // i)
			seti.add(i)
	return seti

def lcm(a, b):
	return a * b // gcd(a, b)

def moore_voting(l):
	count1 = 0
	count2 = 0
	first = 10 ** 18
	second = 10 ** 18
	n = len(l)
	for i in range(n):
		if l[i] == first:
			count1 += 1
		elif l[i] == second:
			count2 += 1
		elif count1 == 0:
			count1 += 1
			first = l[i]
		elif count2 == 0:
			count2 += 1
			second = l[i]
		else:
			count1 -= 1
			count2 -= 1
	for i in range(n):
		if l[i] == first:
			count1 += 1
		elif l[i] == second:
			count2 += 1
	if count1 > n // 3:
		return first
	if count2 > n // 3:
		return second
	return -1

def find_parent(u, parent):
	if u != parent[u]:
		parent[u] = find_parent(parent[u], parent)
	return parent[u]

def dis_union(n):
	par = [i for i in range(n + 1)]
	rank = [1] * (n + 1)
	k = int(input())
	for i in range(k):
		(a, b) = map(int, input().split())
		(z1, z2) = (find_parent(a, par), find_parent(b, par))
		if z1 != z2:
			par[z1] = z2
			rank[z2] += rank[z1]

def dijkstra(n, tot, hash):
	hea = [[0, n]]
	dis = [10 ** 18] * (tot + 1)
	dis[n] = 0
	boo = defaultdict(bool)
	check = defaultdict(int)
	while hea:
		(a, b) = heapq.heappop(hea)
		if boo[b]:
			continue
		boo[b] = True
		for (i, w) in hash[b]:
			if b == 1:
				c = 0
				if (1, i, w) in nodes:
					c = nodes[1, i, w]
					del nodes[1, i, w]
				if dis[b] + w < dis[i]:
					dis[i] = dis[b] + w
					check[i] = c
				elif dis[b] + w == dis[i] and c == 0:
					dis[i] = dis[b] + w
					check[i] = c
			elif dis[b] + w <= dis[i]:
				dis[i] = dis[b] + w
				check[i] = check[b]
			heapq.heappush(hea, [dis[i], i])
	return check

def power(x, y, p):
	res = 1
	x = x % p
	if x == 0:
		return 0
	while y > 0:
		if y & 1 == 1:
			res *= x
		x = x * x
		y = y >> 1
	return res
n = int(input())
ans = []
i = 1
while len(ans) != n - 1:
	if i + 1 == 11:
		i += 1
		continue
	ans.append((i + 1) * 11)
	i += 1
k = 1
for i in range(2, 100):
	if i != 11 and check_prim(i):
		k *= i
ans.append(k)
if n == 2:
	print(-1)
	exit()
for i in ans:
	print(i)


n = int(input())
if n == 2:
	print('-1')
	exit(0)
p = 1
c = 0
primes = []
for i in range(2, 400):
	b = True
	for j in range(2, i):
		if i % j == 0:
			b = False
			break
	if b:
		c += 1
		primes.append(i)
		if c == n:
			break
for i in primes:
	pr = 1
	for j in primes:
		if j != i:
			pr *= j
	print(pr)


def gcd(a, b):
	while b > 0:
		(a, b) = (b, a % b)
	return a
m = int(input())
if m == 2:
	print(-1)
	exit(0)
primes = []
n = 2
while len(primes) < m:
	d = 2
	f = True
	while d * d <= n:
		if n % d == 0:
			f = False
			break
		d += 1
	if f:
		primes.append(n)
	n += 1

def product(a):
	ans = 1
	for b in a:
		ans *= b
	return ans
a = [product([primes[i] for i in range(m) if i != j]) for j in range(m)]
for i in range(m):
	for j in range(i + 1, m):
		if gcd(a[i], a[j]) == 1:
			print('!!!', i, j, a[i], a[j])
b = a[0]
for c in a:
	b = gcd(b, c)
if b != 1:
	print('!!!')
for b in a:
	print(b)


vis = list()
prime = list()
for i in range(1000):
	vis.append(0)
for i in range(2, 1000):
	if vis[i] == 0:
		prime.append(i)
		if len(prime) >= 50:
			break
		j = i + i
		while j < 1000:
			vis[j] = 1
			j += i
tmp = 1
n = int(input())
for i in range(n):
	tmp *= prime[i]
if len(str(tmp // 2)) > 100 or n == 2:
	print(-1)
else:
	for i in range(n):
		print(tmp // prime[i])


import random
n = int(input().strip())
prime = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101]
ans = []

def start():
	global ans
	ans = [1] * n
	for p in prime:
		x = random.randint(0, n - 1)
		for i in range(n):
			if i != x and random.randint(0, 1) == 0:
				ans[i] *= p

def gcd(a, b):
	if b == 0:
		return a
	return gcd(b, a % b)

def check():
	g = 0
	for x in ans:
		g = gcd(g, x)
	if g != 1:
		return False
	for i in range(n):
		for j in range(i + 1, n):
			if gcd(ans[i], ans[j]) == 1:
				return False
			if ans[i] == ans[j]:
				return False
	return True
if n == 2:
	print(-1)
	exit()
while True:
	start()
	if check():
		break
for x in ans:
	print(x)


def primes_upto(limit):
	l = []
	prime = [True] * limit
	for n in range(2, limit):
		if prime[n]:
			l.append(n)
			for c in range(n * n, limit, n):
				prime[c] = False
	return l
n = int(input())
if n == 2:
	print(-1)
else:
	primes = primes_upto(542)
	ans = []
	ans.append(6)
	x = 3
	for i in range(2, n):
		x *= primes[i]
		ans.append(2 * primes[i])
	ans.append(x)
	for i in ans:
		print(i)


def is_prime(n):
	if n == 2 or n == 3:
		return 1
	if n < 2:
		return 0
	for i in range(2, n):
		if n % i == 0:
			return 0
	return 1
primes = [x for x in range(2, 300) if is_prime(x)]
n = int(input())
if n == 2:
	print(-1)
	quit()
cur = 1
for e in primes[:n]:
	cur *= e
for e in range(n):
	print(cur // primes[e])


def sieve(n):
	prime = [True] * 230
	p = 2
	while p * p <= 230:
		if prime[p] == True:
			for i in range(p * p, 230, p):
				prime[i] = False
		p += 1
	ans = []
	for p in range(2, 230):
		if prime[p]:
			ans.append(p)
	return ans
n = int(input())
if n == 2:
	print(-1)
else:
	getprimes = sieve(n)
	product = 1
	for i in range(n):
		product *= getprimes[i]
	for i in range(n):
		print(product // getprimes[i])


n = int(input())
if n is 2:
	print(-1)
else:
	print(6)
	print(10)
	print(15)
	last = 15
	for i in range(n - 3):
		last *= 2
		print(last)


import math as m
n = int(input())
if n == 2:
	print(-1)
else:
	l = []
	k = 100000
	d = dict()
	for i in range(10000):
		d[i] = 1
	for i in range(2, int(m.sqrt(10000))):
		if d[i] == 1:
			for j in range(2 * i, 10000, i):
				d[j] = 0
	for x in range(2, 10000):
		if d[x] == 1:
			l.append(x)
	prime = []
	k = 0
	big = 1
	for x in l:
		k += 1
		big *= x
		prime.append(x)
		if k == n:
			break
	for x in prime:
		print(big // x)


primes = []
ans = []

def sieve(n):
	prime = [True for i in range(n + 1)]
	for p in range(2, n + 1):
		if prime[p] == True:
			primes.append(p)
			for i in range(p * 2, n + 1, p):
				prime[i] = False
n = int(input())
sieve(1000)
tot = 1
for i in range(n - 1):
	ans.append(primes[i] * primes[n - 1])
	tot *= primes[i]
ans.append(tot)
if n == 2:
	print('-1')
else:
	for x in ans:
		print(x)