#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
vector<int> sieve() {
	vector<int>is_prime(100001), ret;
	is_prime[0] = false;
	is_prime[1] = false;
	for (int i = 2; i <= 100000; ++i) {//初期化
		is_prime[i] = true;
	}

	for (int i = 2; i <= 100000; ++i) {
		if (is_prime[i]) {
			ret.push_back(i);
			for (int j = 2 * i; j <= 100000; j += i) {
				is_prime[j] = false;
			}
		}
	}
	return ret;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int m; cin >> m;
	if (0 == m) {
		cout << 1 << endl;
		cout << 1 << endl;
		return 0;
	}
	auto p = sieve();
	reverse(all(p));
	vector<int>ans;
	rep(i, 30) {
		if (1 & (m >> i)) {
			rep(j, i) {
				ans.push_back(p.back());
			}
			if (0 != i)p.pop_back();
			ans.push_back(p.back());
			p.pop_back();
		}
	}
	set<int>st;
	rep(i, ans.size()) {
		if (st.count(ans[i])) {
			ans[i] *= p.back();
			p.pop_back();
		}
		st.insert(ans[i]);
	}
	cout << ans.size() << endl;
	rep(i, ans.size())cout << ans[i] << " ";
	return 0;
}