#include <bits/stdc++.h>

using namespace std;

#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define all(a) (a).begin(),(a).end()

typedef long long ll;
typedef long double ld;
typedef unsigned int uint;
typedef unsigned long long ull;

constexpr const int INT_INF=0x3f3f3f3f; // 1061109567
constexpr const ll LL_INF=0x3f3f3f3f3f3f3f3f; // 4557430888798830399
constexpr const double EPS=1e-9;

// min, max
template <typename T> bool chmax(T& a, T b) {
    if(a<b){a=b;return true;}return false;
}
template <typename T> bool chmin(T& a, T b) {
    if (a>b){a=b;return true;}return false;
}

// INT
#define GCD(a, b) __gcd(a, b)
template <typename T> T LCM(T a, T b) {return a / GCD(a, b) * b;}
template <typename T> T EXTGCD(T a, T b, T& x, T& y) {
    T d = a;
    if (b != 0) {d=EXTGCD(b,a%b,y,x);y-=(a/b)*x;}
    else x=1,y=0;
    return d;
}
template <typename T> bool is_prime(T a) {
    for(int i=2;i*i<=a;i++)if(a%i==0)return true;
    return false;
}

// MOD
const ll MOD = 1000000000 + 7;
#define add(a, b) ((a % MOD) + (b % MOD)) % MOD
#define mul(a, b) ((a % MOD) * (b % MOD)) % MOD
#define sub(a, b) ((a % MOD) + MOD - (b % MOD)) % MOD
template <typename T> T mod_inverse(T a, T mod, bool prime){ // if mod is prime, "prime" is true.
    if(prime){
        T tmp=mod-2,now=a,res=1;while(tmp){if(tmp&1)res=mul(res,now);now=mul(now,now);tmp>>=1;}
        return res;
    }else{T x,y;EXTGCD(a,mod,x,y);return (mod+x%mod)%mod;}
}
#define divide(a, b) ((a % MOD) * (mod_inverse(b, MOD, true))) % MOD

// llのとき、数値の最後に"L"を付ける癖をつけよう.

//
//
//  　　┓　　　┏
//  　＊┗┓　┏┛
//  　　　┫　┣　＊
//  　┏┳┻━┻┳┓
//  　┗┫　　　┣┛
//  ＊　┣　　━┃　＊        Merry Christmas!!
//  　┏┛　　〃┃
//  　┃●　　　┣━┳┓
//  　┗┻┳━━┛　┣┛
//  　＊　┃┏┓┣┓┃
//WWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWWW

int n, m, k;
int p[310];
vector <int> v[310];
int dist[310];

void bfs(int start) {
    dist[start] = 0;
    queue < pair <int,int> > q;
    q.push(mp(start, 0));
    while (q.size()) {
        int now = q.front().fi;
        int nowd = q.front().se;
        q.pop();
        dist[now] = nowd;
        for (int &i : v[now]) {
            q.push(mp(i, nowd + 1));
        }
    }
    for (int i = 0; i < n; i++) {
        dist[i]++;
    }
}
bool prime[60000];

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.precision(10);
    cout << fixed;
#ifdef LOCAL_DEFINE
    FILE *stream1;
    //FILE *stream2;
    stream1 = freopen("/home/aim_cpo/ドキュメント/competitive/CLionProject/competitive/in.txt", "r", stdin);
    //stream2 = freopen("out.txt", "w", stdout);
    if (stream1 == nullptr) return 0;
    //if (stream2 == NULL) return 0;
#endif
    cin >> n;
    for (int i = 0; i <= 55555; i++) prime[i] = 1;
    prime[0] = 0, prime[1] = 0;
    for (int i = 2; i <= 55555; i++) {
        int now = 2 * i;
        while (now <= 55555) {
            prime[now] = 0;
            now += i;
        }
    }
    int cont = 0;
    for (int i = 0; i <= 55555; i++) {
        if (!prime[i])continue;
        string s = to_string(i);
        //cout << s << endl;
        if (s[s.size() - 1] == '1') {
            if (cont != n - 1) cout << s << " ";
            else cout << s << endl;
            cont++;
        }
        if (cont == n) break;
    }
#ifdef  LOCAL_DEFINE
    cerr << "Time elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << "s.\n";
#endif
    return 0;
}

Measured memory_bytes: 384