#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
long long num[102000] = {};
vector<long long> v;
set<long long> s;
int main(){
    long long i,j,n; cin >> n;
    for(i=2;i<=101000;i++){
        if(num[i]!=0) continue;
        for(j=i;j<=101000;j+=i){
            num[j] = i;
        }
    }
    for(i=100001;i<=101000;i++){
        for(j=100001;j<=101000;j++){
            if(s.count(i*j)==0){
                v.push_back(i*j);
                s.insert(i*j);
            }
        }
    }
    v.push_back(1);
    sort(v.begin(),v.end());
    cout << v[n - 1] << endl;
    for(i=0;i<10;i++){
        cout << v[i] << " ";
    }
    cout << endl;
}