#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll n;
vector<ll> v;
map<int,set<ll>> dp;
void f(int n){
dp[n].insert(n-1);
for(int j=2;j<=sqrt(n);j++){
if(n%j) continue;
int iv=n/j;
for(auto x:dp[j]) dp[n].insert(x+iv-1);
if(iv!=j) for(auto x:dp[iv]) dp[n].insert(x+j-1);
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin>>n;
for(int i=1;i<=sqrt(n);i++){
if(n%i) continue;
v.push_back(i);
if(n/i!=i) v.push_back(n/i);
}
sort(v.begin(),v.end());
for(auto x:v) f(x);
cout<<dp[n].size() <<"\n";
for(auto x:dp[n]) cout<<x <<" ";
}
