#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;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<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
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<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

struct osak{
    vector<long long> lpf;// least prime factor
    vector<long long> prime;// prime table
    osak(long long n){//linear_sieve
        lpf=vector<long long>(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<long long,long long> factor(int n) {
        map<long long,long long> factor;
        while (n > 1) {
            factor[lpf[n]]++;
            n /= lpf[n];
        }
        return factor;
    }

    vector<long long> divisor(int N){//O(div.size())
        map<long long,long long> facs=factor(N);
        vector<long long> ret={1};
        for(auto p:facs){
            ll range=ret.size();
            ll now=1;
            for(int i=0;i<p.se;i++){
                now*=p.fi;
                for(int j=0;j<range;j++){
                    ret.emplace_back(ret[j]*now);
                }
            }
        }
        sort(ret.begin(),ret.end());
        return ret;
    }
};
ll limit;
vl ret;
void dfs(vl &v,ll now,ll prec){
	if(ret.size()==limit)return;
	if(prec>100000)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;
}