from math import ceil, gcd
import sys
n = int(input())
if n == 1 or n == 2:
  print(-1)
  sys.exit()
l = ceil(n/2)
# s_list = list(range(3, n+1, 1))
# print(f'l:{l}')
r = []
m = 2
s = 2
r.append(2)
while len(r) < l:
  # s_list.sort()
  # for i in s_list:
  for i in range(s, n+1):
    if len(r) == 0:
      m += 1
      r.append(m)
      if m > n:
        print(-1)
        sys.exit()
      else:
        continue
    if gcd(r[-1], i) != 1 and not i in r:
      # print(f'push {i}')
      r.append(i)
      s = 2
      # s_list.remove(i)
      break
    elif i == n:
      s = r.pop()
      # print(f'pop {s}')
      if s == n:
        print(-1)
        sys.exit()
      else:
        s += 1
        # s_list.append(s)
re = [str(i) for i in r]
print(' '.join(re))