#pragma GCC optimize("Ofast", "unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define vct vector
int k;
vct<int> prds;
vct<vct<int>> prds_lst;
void bcktr(int nm = k, int prv_prd = 2) {
if (nm != 1 && nm < prv_prd) return;
if (nm == 1) { prds_lst.push_back(prds); return; }
vct<int> dvs;
for (int dv = 1; dv * dv <= nm; dv++) {
if (nm % dv != 0) continue;
if (dv != 1 && dv >= prv_prd) dvs.push_back(dv);
if (nm / dv != dv && nm / dv >= prv_prd) dvs.push_back(nm / dv);
}
for (int dv : dvs) {
prds.push_back(dv);
bcktr(nm / dv, dv);
prds.pop_back();
}
}
set<int> ans;
void cmp() {
for (vct<int> lst : prds_lst) {
int cnt = 0;
for (int x : lst) cnt += x - 1;
ans.insert(cnt);
}
}
signed main() {
// freopen("tys.in", "r", stdin);
cin.sync_with_stdio(false), cin.tie(0);
cin >> k;
bcktr();
cmp();
cout << ans.size() << '\n';
for (int x : ans) cout << x << " ";
cout << '\n';
}
