Little boy Valera studies an algorithm of sorting an integer array. After studying the theory, he went on to the practical tasks. As a result, he wrote a program that sorts an array of *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> in the non-decreasing order. The pseudocode of the program, written by Valera, is given below. The input of the program gets number *n* and array *a*.

But Valera could have made a mistake, because he hasn't yet fully learned the sorting algorithm. If Valera made a mistake in his program, you need to give a counter-example that makes his program work improperly (that is, the example that makes the program sort the array not in the non-decreasing order). If such example for the given value of *n* doesn't exist, print -1.
You've got a single integer *n* (1 ≤ *n* ≤ 50) — the size of the sorted array.
# Peace for Ukraine  
# ------------------------------------------------------------------------------------------------------------
# PyPy m krio Python m nhi 
import sys,os,io
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
#sorted_x = sorted(x.items(), key=lambda kv: kv[1]) 
# returns list
#{k: v for k, v in sorted(x.items(), key=lambda item: item[1])}
# returns dict
#input = sys.stdin.readline
# Both + and ^ ops changes parity if one of the operand is odd 
from collections import defaultdict, Counter,deque
mod = 10 ** 9 + 7
def yn(f): 
	print("NO" if f else "YES")
import math
n=int(input())
if(n==1):
    print(-1)
else:
    res=[0]*n 
    z=2 
    for i in range(n-2,-1,-1):
        res[i]=z 
        z+=1 
    res[-1]=1 
    print(*res)
