#include using namespace std; //#pragma GCC optimize("Ofast") #define rep(i,n) for(ll i=0;i=0;i--) #define perl(i,r,l) for(ll i=r-1;i>=l;i--) #define fi first #define se second #define pb push_back #define ins insert #define pqueue(x) priority_queue,greater> #define all(x) (x).begin(),(x).end() #define CST(x) cout<> #define rev(x) reverse(x); using ll=long long; using vl=vector; using vvl=vector>; using pl=pair; using vpl=vector; using vvpl=vector; const ll MOD=1000000007; const ll MOD9=998244353; const int inf=1e9+10; const ll INF=4e18; const ll dy[9]={1,0,-1,0,1,1,-1,-1,0}; const ll dx[9]={0,1,0,-1,1,-1,1,-1,0}; template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } struct osak{ vector lpf;// least prime factor vector prime;// prime table osak(long long n){//linear_sieve lpf=vector(n+1,-1); for (int d = 2; d <= n; ++d) { if(lpf[d]==-1){ lpf[d]=d;prime.emplace_back(d); } for(auto p:prime){ if(p*d>n||p>lpf[d])break; lpf[p*d]=p; } } } map factor(int n) { map factor; while (n > 1) { factor[lpf[n]]++; n /= lpf[n]; } return factor; } vector divisor(int N){//O(div.size()) map facs=factor(N); vector ret={1}; for(auto p:facs){ ll range=ret.size(); ll now=1; for(int i=0;i100000)return; ret.emplace_back(prec); ll hoge=now; repl(i,hoge,v.size()-1){ now=i; dfs(v,now,prec*v[now]); } } int main(){ ll m;cin >> m; //m=1<<30;m--; osak os(100000); vvl ans(30); ll now=os.prime.size()-1; rep(i,30){ while(ans[i].size()<29-i){ if(os.prime[now]*os.prime[i]>100000){ now--;continue; } ans[i].emplace_back(os.prime[now]*os.prime[i]);now--; } //cout << os.prime[now] << endl; } vl ret; per(i,30){ if(m>>i&1){ ll f=29-i; for(auto p:ans[f])ret.emplace_back(p); ret.emplace_back(os.prime[os.prime.size()-i-1]); } } cout << ret.size() << endl; rep(i,ret.size()){ if(i)cout << " "; cout << ret[i]; } cout << endl; }