Monsters

/*
   (( '-""``""-' ))
     )-__-_.._-__-(
   / --- (o _ o) --- \
   \ .-* ( .0. ) *-. /
   _'-. ,_ '=' _, .-'_
  / ;#'#'# - #'#'#; \
 \_)) -----'#'----- ((_/
      # --------- #
      '# ------- #'
  /..-'# ------- #'-.\
  _\...-\'# -- #'/-.../_
  ((____)- '#' -(____))
    art by - Vinni01 / luchi abi
 
    cout << fixed << setprecision(6) << x;
    freopen ( "sum.in", "r", stdin )
*/
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
using namespace std ;
#define ll long long
#define dd double
#define ff first
#define ss second
#define pb push_back 
#define pf push_front
#define UseOFF ios_base::sync_with_stdio(0);cin.tie(0), cout.tie(0);
#define sz size
#define ins insert
#define new jweijofdg
const ll N = 1e6 + 111 ;
ll tt = 1 ;
map < char, ll > cnt, cnt2 ;
string abc = "abcdefghijklmnopqrstuvwxyz" ;
string s ;
ll p2[ 1111 ][ 27 ], su2[ 1111 ][ 27 ] ;
map < ll, bool > mp ;
void solve()
{
	ll n ;
	cin >> n ;
	if( n < 3 )
	{
		cout << -1 ;
		return ;
	}
	if( n == 3 )
	{
		cout << "55\n99\n11115" ;
		return ;
	}
	vector < ll > v = { 385, 360, 792, 8360 } ;
	n -= 4 ;
	while( n-- )
	{
		ll x = v[ v.sz() - 1 ] ;
		x += 8360 ;
		v.pb( x ) ; 
	}
	for( auto to : v )
	{
		cout << to << '\n' ;
	}
}
signed main()
{
	UseOFF
	//cin >> tt ;
	while( tt-- )
	{
		solve() ;
	}
}