#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
#define int long long
unordered_map<int, unordered_map<int, bool> > mp;
int n;
vector<int> p;
void f(int cur, int sum, int last){
if(mp[cur][sum]) return;
mp[cur][sum] = true;
if(cur == n) return;
for(int id = last; id < (int)p.size(); id++){
int x = p[id];
if((cur * x) > n) break;
if(!mp[cur * x][sum + x - 1]) f(cur*x, sum + x - 1, id);
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
cin >> n;
for(int i = 2; i * i <= n; i++){
if(n%i != 0) continue;
p.push_back(i);
if(n / i != i) p.push_back(n / i);
}
p.push_back(n);
sort(all(p));
f(1, 0, 0);
vector<int> ans;
for(auto x : mp[n]) ans.push_back(x.ff);
sort(all(ans));
cout << ans.size() << '\n';
for(auto x : ans) cout << x << ' ';
return 0;
}
