#include <bits/stdc++.h>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
using namespace std;
vector<pair<int,int>> fact;
vector<int> poss;
map<pair<int,int>,bool> vis;
unordered_set<int> out;
void dp(int rem, int sm){
if(rem==1) {
out.insert(sm);
return;
}
for (int i = 1; i < sz(poss); i++)
{
if(poss[i]>rem) break;
if(rem%poss[i]) continue;
dp(rem/poss[i],sm+poss[i]-1);
}
}
signed main() {
ios_base::sync_with_stdio(false); cin.tie(nullptr);
int n; cin >> n;
sort(all(fact));
for (int i = 1; i <= sqrt(n); i++)
{
if(n%i) continue;
if(n/i==i) poss.push_back(i);
else{
poss.push_back(i);
poss.push_back(n/i);
}
}
sort(all(poss));
dp(n,0);
cout << sz(out) << "\n";
vector<int> ot;
for (auto u : out) ot.push_back(u);
sort(all(ot));
for (auto u : ot) cout << u << " ";
cout << "\n";
return 0;
}
