#include <bits/stdc++.h>
#define fast_input ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
#define ii pair<int, int>
#define iii pair<int, ii>
#define ll long long
#define ull unsigned long long
#define pq priority_queue
#define FOR(v, s, e) for (int v = s; v < e; v++)
#define FOR_REV(v, s, e) for (int v = e - 1; v >= s; v--)
#define make_ii(a, b) make_pair(a, b)
#define make_iii(a, b, c) make_pair(a, make_pair(b, c))
#define fi first
#define se second
//#define int long long
int n, n_mod, fac = 2, ct;
vector<ii> pfac;
vector<int> factors;
vector<vector<ii>> adj_list;
set<int> answers;
void create_tree(int curr, int l_idx, int curr_idx) {
if (adj_list.size() <= curr_idx) adj_list.resize(curr_idx + 1);
if (curr == n) return;
FOR(i, l_idx, factors.size()) {
int factor = factors[i];
int new_factor = curr * factor;
if (curr > n / factor) return;
if (n % new_factor == 0 && (n / new_factor >= factor || n == new_factor)) {
int nidx = adj_list.size() + 1;
adj_list[curr_idx].emplace_back(factor, nidx);
create_tree(new_factor, i, nidx);
}
}
}
void dp_factors(int idx, int curr) {
if (idx == pfac.size()) {
if (curr != 1) factors.push_back(curr);
return;
}
ii factor = pfac[idx];
int c_exp = 1;
FOR(i, 0, factor.se + 1) {
dp_factors(idx + 1, curr * c_exp);
c_exp *= factor.fi;
}
}
void dfs(int nd, int c_sum, int c_total) {
if (c_total == n) {
answers.insert(c_sum);
return;
}
for(ii node : adj_list[nd]) {
dfs(node.se, c_sum + node.fi - 1, c_total * node.fi);
}
}
int32_t main() {
fast_input;
cin >> n;
n_mod = n;
while (fac * fac <= n_mod) {
ct = 0;
for (;n_mod % fac == 0;ct++) {
n_mod = n_mod / fac;
}
if (ct != 0) {
pfac.emplace_back(fac, ct);
}
fac++;
}
if (n_mod != 1) pfac.emplace_back(n_mod, 1);
// build factors
dp_factors(0, 1);
sort(factors.begin(), factors.end());
create_tree(1, 0, 0);
dfs(0, 0, 1);
cout << answers.size() << '\n';
for(int answer: answers) {
cout << answer << ' ';
}
}
