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.
inf = 1001

def merge(L, n1, R, n2):
    L.append(inf)
    R.append(inf)
    a = []
    i = j = 0
    while i < n1 or j < n2:
        if L[i] < R[j]:
            a.append(L[i])
            i += 1
        else:
            a.append(R[j])
            j += 1
    return a

def msort(a, n):
    if n == 1:
        return a
    else:
        n1 = n // 2
        n2 = n - n1
        L = a[:n1]
        R = a[n1:]
        L = msort(L, n1)
        R = msort(R, n2)
        return(merge(L, n1, R, n2))

def buggy(a, n):
    for i in range(1, n):
        for j in range(i, n-1):
            if a[j] > a[j+1]:
                temp = a[j]
                a[j] = a[j+1]
                a[j+1] = temp
    return a

n = int(input())
a = []
k = 100

if n == 1:
    a.append(1)
else:
    for i in range(n):
        a.append(k-i)

r = a[:]

answer = msort(r, n)
buggy_result = buggy(r, n)

if buggy_result == answer:
    print(-1)
else:
    for x in a:
        print(x, end = ' ')