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

Difficulty: MEDIUM_HARD

Solutions:
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])


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)


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])


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])


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()


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)


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)


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])


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()


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])


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')


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])


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])


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]))


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(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])


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])


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)