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.
def s(a):
    k = len(a)
    for i in range(k-1):
        for j in range(i,k-1):
            if a[j] > a[j+1]:
                a[j],a[j+1] = a[j+1],a[j]
    return a
def main():
    n = int(input())
    if n <= 2:
        v = [-1]
    else:
        v = [int(i) for i in range(n,0,-1)]
    print(*v,sep = ' ')
if __name__ == '__main__':
    main()
