Buggy Sorting

题意翻译

Valera 写了一个排序的算法（伪代码）： ```cpp for(int i=1;i<n;++i) for(int j=i;j<n;++j) if(a[j]>a[j+1]) swap(a[j],a[j+1]);//这是错的 ``` 给你一个 $n$ 表示数组的长度， 请你构造一组数据，Hack 掉他的算法。 如果无法 Hack，就输出 $- 1$。

题目描述

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_{1},a_{2},...,a_{n} $ 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 $ . `<br></br>loop integer variable $ i $ from $ 1 $ to $ n-1 $ <br></br>    loop integer variable $ j $ from $ i $ to $ n-1 $ <br></br>        if $ (a_{j}&gt;a_{j+1}) $ , then swap the values of elements $ a_{j} $ and $ a_{j+1} $ <br></br>`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.

输出格式

Print $ n $ space-separated integers $ a_{1},a_{2},...,a_{n} $ $ (1<=a_{i}<=100 $ ) — the counter-example, for which Valera's algorithm won't work correctly. If the counter-example that meets the described conditions is impossible to give, print -1. If there are several counter-examples, consisting of $ n $ numbers, you are allowed to print any of them.

输入输出样例

输入样例 #1

1

输出样例 #1

-1