#include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } const int N = 100000; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; vector is_prime(N+1, true); is_prime[0] = false; is_prime[1] = false; deque primes; for(int p = 2; p <= N; p++){ if(!is_prime[p]) continue; primes.push_back(p); for(int i = 0; i*p <= N; i++) is_prime[i*p] = false; } int m; cin >> m; vector ans; for(int i = 30; i >= 1; i--){ int x = (1<= x){ int p = primes.front(); primes.pop_front(); for(int j = 0; j < i; j++){ while((ll)primes.back()*p > N) primes.pop_back(); int q = primes.back(); primes.pop_back(); ans.push_back(p*q); } m -= x; } } cout << ans.size() << endl; print_vector(ans); }