#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) x.bg(), x.ed()
#define sz(x) (int)x.size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int i = l; i <= r; ++i)
#define FOS(i, r, l) for (int i = r; i >= l; --i)
#define FRN(i, n) for (int i = 0; i < n; ++i)
#define FSN(i, n) for (int i = n - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : x)
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
END OF TEMPLATE
----------------------------------------------------------------
Tran The Bao - ghostwriter
Training for VOI23 gold medal
----------------------------------------------------------------
GOAT
----------------------------------------------------------------
*/
const int N = 3001;
int n;
vi ans[N];
vi getd(int n) {
vi ans;
for (int i = 1; 1LL * i * i <= n; ++i) {
if (n % i != 0) continue;
int a = i, b = n / i;
ans.pb(a);
if (b != a) ans.pb(b);
}
return ans;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
cin >> n;
vi d = getd(n);
sort(all(d));
FRN(i, sz(d)) {
ans[i].pb(d[i] - 1);
FRN(j, i) {
if (d[i] % d[j] != 0) continue;
EACH(z, ans[j])
ans[i].pb(z + d[i] / d[j] - 1);
}
sort(all(ans[i]));
vi ans1;
ans1.pb(ans[i][0]);
FOR(j, 1, sz(ans[i]) - 1)
if (ans[i][j] != ans[i][j - 1])
ans1.pb(ans[i][j]);
swap(ans[i], ans1);
}
cout << sz(ans[sz(d) - 1]) << '\n';
EACH(i, ans[sz(d) - 1]) cout << i << ' ';
return 0;
}
/*
12
----------------------------------------------------------------
From Benq:
stuff you should look for
* int overflow, array bounds
* special cases (n=1?)
* do smth instead of nothing and stay organized
* WRITE STUFF DOWN
* DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/
