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.
    #include<bits/stdc++.h>
    #include<set>
    #include<ctype.h>
    #define max(a,b) (a>b?a:b)
    #define min(a,b) (a<b?a:b)
    #define int long long
    #define IOS ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #define forn(i,n) for(int i=0;i<n;i++)
    #define pt(x,y) printf("%.12f %.12f\n",x*co+y*si+px,-x*si+y*co+py);
    #define forr(i,a,n) for(i=a;i<n;i++)
    #define f(x9,y9) for( int i=x9;i<y9;i++)
    using namespace std;
    typedef long long ll;
    void pairsort(int a[], int b[], int k)
    {
    pair<int, int> pairt[k];


    for (int i = 0; i < k; i++)
    {
        pairt[i].first = a[i];
        pairt[i].second = b[i];
    }

    sort(pairt, pairt + k);

    for (int i = 0; i < k; i++)
    {
        a[i] = pairt[i].first;
        b[i] = pairt[i].second;
    }
    }
    int CheckPrime(int k)
    {
    for(int i=2;i<k;i++)
    if(k%i==0)
    return 0;
    return 1;
    }
    int countdigit(long long n)
    {
    return floor(log10(n)+1);
    }

    long long C(int n, int r) {
    if(r>n-r)
    r=n-r;
    long long ans=1;
    for(int i=1;i<=r;i++){
    ans*=n-r+i;
    ans/=i;
    }
    return ans;
    }
    bool ispalind(string str){
    size_t len = str.length();

    for(int i = 0; i < len/2; i++){
        if(str[i] != str[len-1-i]){
            return false;
        }
    }
    return true;
    }
    
    int gcd(int a,int b)
    {
        if(b==0)
            return a;
        else 
            return gcd(b,a%b);
    }

    int lcm(int a,int b)
    {
        return a/gcd(a,b)*b;
    }

    int MOD=1000000;

int32_t main()
{
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int n;
cin>>n;
if(n<=2)cout<<"-1";
else 
{
    for(int i=n;i>0;i--)
    {
        cout<<i<<" ";
    }
}
}





