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.
n = int (input())
a = [78, 22, 56, 42, 49, 97, 34, 2, 46, 9, 67, 71, 99, 95, 41, 2, 85, 27, 45, 55, 62, 19, 39, 49, 39, 41, 85, 91, 28, 85, 10, 5, 6, 66, 46, 55, 62, 80, 56, 7, 89, 23, 77, 87, 18, 18, 89, 3, 44, 33]

for i in range (1, n - 1):
    for j in range (i, n - 1):
        if a[i] > a[i + 1]:
            a[i], a[i + 1] = a[i + 1], a[i]
            
b = a[0:n]

print(*b)