题解 | #小红的排列构造#

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll>PII;
const int N = 2e5 + 10;
const int MOD = 998244353;
const int INF = 0X3F3F3F3F;
const int dx[] = {-1, 1, 0, 0, -1, -1, +1, +1};
const int dy[] = {0, 0, -1, 1, -1, +1, -1, +1};
const int M = 1e6 + 10;

int main()
{
	int n;
	cin >> n;
	if(n <= 2) cout << -1 << endl;
	else {
		cout << 3 << " " << 2 << ' ' << 1 << " "; 
		for(int i = 4; i <= n; i ++) cout << i << " ";
	}

	return 0;
}