#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
const int N = 1e5+1;
void solve() {
int n;
cin >> n;
vi ds;
for (int i=1;i*i<=n;i++) {
if (n%i) continue;
ds.push_back(i);
if (n/i == i) continue;
ds.push_back(n/i);
}
sort(all(ds));
int d = big(ds);
vector<set<int>> stuf(d);
vi dvs[d];
for (int i = 0;i<d;i++) {
for (int j = i;j<d;j++) {
if (ds[j]%ds[i] == 0) dvs[j].push_back(i);
}
}
for (int i = 0;i<d;i++) {
for (auto it : dvs[i]) {
stuf[i].insert(ds[i]-1);
for (auto itt : stuf[it]) {
stuf[i].insert(itt+(ds[i]/ds[it])-1);
}
}
}
cout << big(stuf.back()) << '\n';
for (auto it : stuf.back()) cout << it << ' ';
cout << '\n';
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef Dodi
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
