// Starcraft 2 enjoyer //
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
using namespace std;
#define LSOne(X) ((X) & -(X))
const int N = 3e5 + 5;
const int M = 1 << 10 + 5;
const int B = 18;
const long long K = 2;
const int LG = 60;
const long long INF = 1e18 + 5;
const int C = 26;
const int MOD = 1e9 + 7;
int n;
vector<int> dv;
set<int> val[M];
inline void solve()
{
cin >> n;
for (int x = sqrt(n); x >= 1; x--)
{
if (n % x == 0)
{
dv.push_back(x);
dv.push_back(n / x);
}
}
sort(dv.begin(), dv.end());
dv.erase(unique(dv.begin(), dv.end()), dv.end());
val[0].insert(0);
for (int x = 1; x < dv.size(); x++)
{
for (int y = x - 1; y >= 1; y--)
{
if (dv[x] % dv[y] == 0)
{
if (dv[x] <= 1LL * dv[y] * dv[y])
{
for (int i : val[y])
{
val[x].insert(i + (dv[x] / dv[y]) - 1);
}
}
}
}
val[x].insert(dv[x] - 1);
}
cout << val[dv.size() - 1].size() << "\n";
for (int i : val[dv.size() - 1])
{
cout << i << " ";
}
}
signed main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int t = 1;
// cin >> t;
for (int x = 1; x <= t; x++)
{
solve();
}
return 0;
}
