#include <bits/stdc++.h>
using namespace std;
#define forsn(i, s, n) for (int i = int(s); i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define dforsn(i, s, n) for (int i = int(n) - 1; i >= int(s); i--)
#define dforn(i, n) dforsn(i, 0, n)
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vb = vector<bool>;
using pll = pair<ll, ll>;
#define sz(x) int(x.size())
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define fst first
#define snd second
map<ll, vll> memo;
vll solve(ll n) {
if (memo.count(n)) return memo[n];
vll ret = {n - 1};
for (int d = 2; d * d <= n; d++) {
if (n % d) continue;
for (ll prev : solve(n / d)) {
ret.pb(prev + d - 1);
}
if (d != n / d) for (ll prev : solve(d)) {
ret.pb(prev + n / d - 1);
}
}
sort(all(ret));
ret.erase(unique(all(ret)), end(ret));
return memo[n] = ret;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
int n;
cin >> n;
vll ret = solve(n);
cout << sz(ret) << "\n";
for (ll x : ret) cout << x << " ";
cout << "\n";
return 0;
}
