Problem: Little Petya has a birthday soon. Due this wonderful event, Petya's friends decided to give him sweets. The total number of Petya's friends equals to n.

Let us remind you the definition of the greatest common divisor: GCD(a1, ..., ak) = d, where d represents such a maximal positive number that each ai (1 ≤ i ≤ k) is evenly divisible by d. At that, we assume that all ai's are greater than zero.

Knowing that Petya is keen on programming, his friends has agreed beforehand that the 1-st friend gives a1 sweets, the 2-nd one gives a2 sweets, ..., the n-th one gives an sweets. At the same time, for any i and j (1 ≤ i, j ≤ n) they want the GCD(ai, aj) not to be equal to 1. However, they also want the following condition to be satisfied: GCD(a1, a2, ..., an) = 1. One more: all the ai should be distinct.

Help the friends to choose the suitable numbers a1, ..., an.

Input

The first line contains an integer n (2 ≤ n ≤ 50).

Output

If there is no answer, print "-1" without quotes. Otherwise print a set of n distinct positive numbers a1, a2, ..., an. Each line must contain one number. Each number must consist of not more than 100 digits, and must not contain any leading zeros. If there are several solutions to that problem, print any of them.

Do not forget, please, that all of the following conditions must be true:

  * For every i and j (1 ≤ i, j ≤ n): GCD(ai, aj) ≠ 1
  * GCD(a1, a2, ..., an) = 1
  * For every i and j (1 ≤ i, j ≤ n, i ≠ j): ai ≠ aj



Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Examples

Input

3


Output

99
55
11115


Input

4


Output

385
360
792
8360

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
long long power(long long b, long long p) {
  long long res = 1;
  while (p) {
    if (p % 2) {
      res = (res * b) % 1000000007;
      p--;
    } else {
      b = (b * b) % 1000000007;
      p /= 2;
    }
  }
  return res;
}
void update(int node, int start, int end, int idx, int val, vector<int> &tree) {
  if (start == end) {
    tree[node] = val;
    return;
  }
  int mid = (start + end) / 2;
  if (idx >= start && idx <= mid)
    update(2 * node, start, mid, idx, val, tree);
  else
    update(2 * node + 1, mid + 1, end, idx, val, tree);
  tree[node] = max(tree[2 * node], tree[2 * node + 1]);
}
int query(int node, int start, int end, int l, int r, vector<int> &tree) {
  if (r < start || l > end) return 0;
  if (start >= l && end <= r) return tree[node];
  int mid = (start + end) / 2;
  return max(query(2 * node, start, mid, l, r, tree),
             query(2 * node + 1, mid + 1, end, l, r, tree));
}
long long dfs(long long r, vector<vector<long long> > &v, vector<long long> &dp,
              vector<long long> &vis) {
  vis[r] = 1;
  long long c = 0;
  for (long long i = 0; i < v[r].size(); i++) {
    if (!vis[v[r][i]] && v[r][i] < r)
      c = max(c, dfs(v[r][i], v, dp, vis));
    else if (v[r][i] < r)
      c = max(c, dp[v[r][i]]);
  }
  return dp[r] = c + 1;
}
int main() {
  long long n, j, i;
  cin >> n;
  if (n == 2) {
    cout << -1;
    return 0;
  }
  vector<long long> p(1000), a;
  for (i = 2; i < 1000; i++) {
    if (a.size() == n + 3) break;
    if (!p[i]) {
      for (j = 2; j * i < 1000; j++) p[i * j] = 1;
      a.push_back(i);
    }
  }
  for (i = 0; i < n - 1; i++) a[i] *= a[n];
  a[n - 1] *= a[n + 1];
  a[0] *= a[n + 1];
  for (i = 1; i < n; i++) a[i] *= a[n + 2];
  for (i = 0; i < n; i++) cout << a[i] << endl;
}