#include <bits/extc++.h>
using namespace std;
set<int> ans;
__gnu_pbds::gp_hash_table<int, vector<int>> dvs;
void brute(int n, int sum, int prv) {
ans.insert(n+sum-1);
for (int i: dvs[n]) {
if (i < prv) break;
brute(n/i, sum+i-1, i);
}
}
signed main() {
ios::sync_with_stdio(0); cin.tie(0);
int n; cin >> n; vector<int> dv;
for (int i = 1; i*i <= n; i++) {
if (n % i == 0) {
int a = i, b = n/i;
dv.push_back(a);
if (a != b) dv.push_back(b);
}
}
for (int j: dv) {
for (int i = 1; i*i <= j; i++) {
if (j % i == 0) {
int a = i, b = j/i;
if (a != 1 && a != j) dvs[j].push_back(a);
if (a != b && b != 1 && b != j) dvs[j].push_back(b);
}
}
sort(dvs[j].begin(), dvs[j].end(), greater<int>());
}
brute(n, 0, 0);
cout << ans.size() << '\n';
for (int i: ans) cout << i << ' ';
return 0;
}
