#include <bits/stdc++.h>
using namespace std;
int v[1000000];
int buggy_sorting(int n) {
  if (n == 1 || n == 2) return 0;
  v[0] = 5;
  v[1] = 6;
  v[2] = 1;
  for (int i = 3; i < n; i++) v[i] = i;
  return 1;
}
void median() {
  int t, n, k, pas, cnt;
  long long int s;
  cin >> t;
  for (int z = 0; z < t; z++) {
    cin >> n >> k;
    pas = n / 2;
    for (int i = 0; i < n * k; i++) cin >> v[i];
    cnt = 0;
    s = 0;
    for (int i = n * k - 1 - pas; i >= 0; i -= pas + 1)
      if (cnt < k) {
        s += v[i];
        cnt++;
      }
    cout << s << '\n';
  }
}
int main() {
  int n;
  cin >> n;
  if (buggy_sorting(n))
    for (int i = 0; i < n; i++) cout << v[i] << " ";
  else
    cout << -1;
  return 0;
}
