#include <iostream>
#include <vector>
#include <set>
#include <unordered_set>
#include <algorithm>
using namespace std;
vector<int> divisors;
vector<int> answer;
void bruh(int n, int s) {
if (n == 1) {
answer.push_back(s);
return;
}
for (int d : divisors) {
if (d >= n) return;
if (n % d) continue;
bruh(d, s + n / d - 1);
}
}
signed main()
{
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
// freopen("input.txt", "r", stdin);
int n;
cin >> n;
for (int d = 1; d * d <= n; d++) {
if (n % d == 0) {
divisors.push_back(d);
if (d * d < n) {
divisors.push_back(n / d);
}
}
}
sort(divisors.begin(), divisors.end());
bruh(n, 0);
sort(answer.begin(), answer.end());
auto end = unique(answer.begin(), answer.end());
cout << end - answer.begin() << '\n';
for (auto it = answer.begin(); it != end; ++it) {
cout << *it << ' ';
}
return 0;
}
