// Original C++ solution (slower):
#include <bits/stdc++.h>

#include <math.h>

#define _GLIBCXX_DEBUG

#define _LIBCPP_DEBUG 0



using namespace std;

#define ll long long

#define rep(i,n) for (int i = 0; i < n; i++)

#define rrep(i,n) for (int i = n-1; i >= 0; i--)

#define MOD (1000000007)

#define vi vector<int>

#define vl vector<ll>

#define vb vector<bool>

#define vvi vector<vi>

#define vvl vector<vl>

#define pii pair<int, int>

#define pli pair<ll, int>a

#define pb push_back

#define sz(x) int(x.size())



#define mp make_pair

#define all(a) (a).begin(),(a).end()



template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }



ll gcd(ll a, ll b) {

    if (b == 0) return a;

    else return gcd(b, a % b);

}



ll keta(ll n){

  string s = to_string(n);

  ll num = s.size();

  return num;

}



const ll INF = 1LL << 60;



const int dh[4] = {1,0,-1,0};

const int dw[4] = {0,1,0,-1};



struct Edge{

  int to;

  int weight;

  Edge(int t, int w) : to(t), weight(w){}

};

using Graph = vector<vector<Edge>>;

using P = pair<ll, int>;



class UnionFind{

  public:

  vi Parent;

  UnionFind(int n){

    Parent = vi(n,-1);

  }



  int root(int a){

    if(Parent[a] < 0) return a;

    else return Parent[a] = root(Parent[a]);

  }



  int size(int a){

    return -Parent[root(a)];

  }



  bool merge(int a, int b){

    a = root(a);

    b = root(b);

    if(a == b) return false;



    if(size(a) < size(b)) swap(a,b);

    Parent[a] += Parent[b];

    Parent[b] = a;



    return true;

  }

};



class Factrial{

  public:

  vl Fac;

  Factrial(int MAX){

    Fac = vl(MAX+1);

    rep(i,MAX) {

      if(i == 0) Fac[i+1] = 1;

      else Fac[i+1] = ((i+1)*Fac[i])%MOD;

    }

  }

};



class Eratosthenes{

  public:

  vi P;

  vb Prime;

  Eratosthenes(int MAX){

    Prime = vb(MAX+1,true);

    for(int i = 2; i <= MAX; i++) {

      if(Prime[i]){

        P.pb(i);

        for(int j = i*2; j <= MAX; j += i) {

          Prime[j] = false;

        }

      }

    }

  }

  int size(){

    return P.size();

  }

};



int main(){

  int n; cin >> n;

  int m = 55555;

  Eratosthenes E(m);

  vi a;

  while(sz(a) < n){

    rep(i,E.size()) {

      if(E.P[i]%5 == 1) a.pb(E.P[i]);

    }

  }

  rep(i,n) cout << a[i] << " ";

}

// Optimized solution to the same problem (faster):
#include <bits/stdc++.h>

#include <math.h>

#define _GLIBCXX_DEBUG

#define _LIBCPP_DEBUG 0



using namespace std;

#define ll long long

#define rep(i,n) for (int i = 0; i < n; i++)

#define rrep(i,n) for (int i = n-1; i >= 0; i--)

#define MOD (1000000007)

#define vi vector<int>

#define vl vector<ll>

#define vb vector<bool>

#define vvi vector<vi>

#define vvl vector<vl>

#define pii pair<int, int>

#define pli pair<ll, int>a

#define pb push_back

#define sz(x) int(x.size())



#define mp make_pair

#define all(a) (a).begin(),(a).end()



template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }



ll gcd(ll a, ll b) {

    if (b == 0) return a;

    else return gcd(b, a % b);

}



ll keta(ll n){

  string s = to_string(n);

  ll num = s.size();

  return num;

}



const ll INF = 1LL << 60;



const int dh[4] = {1,0,-1,0};

const int dw[4] = {0,1,0,-1};



struct Edge{

  int to;

  int weight;

  Edge(int t, int w) : to(t), weight(w){}

};

using Graph = vector<vector<Edge>>;

using P = pair<ll, int>;



// dist[v] に頂点 s から頂点 v への距離を入れる関数

void dijkstra(int s, Graph &G, vector<ll> &dist){

  fill(all(dist), INF);

  dist[s] = 0;



  priority_queue<P, vector<P>, greater<P>> pq;//距離が小さい順に取り出す

  pq.push(P(0,s)); // 頂点 s からスタート



  while (!pq.empty()) {

    P p = pq.top(); pq.pop();

    int v = p.second;

    if(dist[v] < p.first) continue;// 既に v に辿り着く短い経路有ならスルー (これはただの高速化)



    for(auto e : G[v]){// v から行ける頂点 nv 達を走査

      int nv = e.to;

      ll w = e.weight;

      if(dist[nv] > dist[v] + w){

        dist[nv] = dist[v] + w;

        pq.push(P(dist[nv], nv));

      }

    }

  }

}



class UnionFind{

public:

  vi Parent;

  UnionFind(int n){

    Parent = vi(n,-1);

  }



  int root(int a){

    if(Parent[a] < 0) return a;

    else return Parent[a] = root(Parent[a]);

  }



  int size(int a){

    return -Parent[root(a)];

  }



  bool merge(int a, int b){

    a = root(a);

    b = root(b);

    if(a == b) return false;



    if(size(a) < size(b)) swap(a,b);

    Parent[a] += Parent[b];

    Parent[b] = a;



    return true;

  }

};



class Factrial{

public:

  vl Fac;

  Factrial(int MAX){

    Fac = vl(MAX+1);

    rep(i,MAX) {

      if(i == 0) Fac[i] = 1;

      else Fac[i+1] = ((i+1)*Fac[i])%MOD;

    }

  }

};







int main(){

  int n; cin >> n;

  int MAX = 55555;

  vb Prime(MAX+1,true);

  vi ans;

  for(int i = 2; i < MAX+1; i++) {

    if(Prime[i]){

      for(int j = 2*i; j < MAX+1; j += i) {

        Prime[j] = false;

      }

      if(i%5 == 1){

        ans.pb(i);

      }

    }

    if(ans.size() == n) break;

  }



  rep(i,n) cout << ans[i] << " ";

  cout << endl;

}

// Fastest known solution for this problem: