#include <bits/stdc++.h>
#define ll long long
#define str string
#define ins insert
#define ld long double
#define pb push_back
#define pf push_front
#define pof pop_front()
#define pob pop_back()
#define lb lower_bound
#define ub upper_bound
#define endl "\n"
#define fr first
#define sc second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define sz size()
#define vll vector<ll>
#define bc back()
#define arr array
#define pll vector<pair<ll,ll>>
using namespace std;/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>*/
template<class S,class T>
bool chmin(S &a,const T &b) {
return a>b?(a=b)==b:false;
}
template<class S,class T>
bool chmax(S &a,const T &b) {
return a<b?(a=b)==b:false;
}
//void fre(string s){freopen((s+".in").c_str(),"r",stdin);freopen((s+".out").c_str(),"w",stdout);}
void start(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
const ll inf=1e18;
const ll mod=998244353;
const ll N=1e5+5;
const ld eps=1e-9;
void solve(){
ll i,j;
ll n;
cin>>n;
vll div;
vector<set<ll>> ans;
for(i=1;i<=sqrt(n);i++){
if(n%i==0){
div.pb(i);
if(i*i!=n) div.pb(n/i);
}
}
sort(all(div));
ans.resize(div.sz);
ans[0].ins(0);
for(i=0;i<div.sz;i++){
for(j=0;j<i;j++){
if(div[i]%div[j]==0){
for(auto q : ans[j]){
ans[i].ins(q+div[i]/div[j]-1);
}
}
}
}
cout<<ans.bc.sz<<endl;
for(auto i : ans.bc) cout<<i<<' ';
cout<<endl;
}
signed main(){
start();
ll t=1;
//cin>>t;
while(t--) solve();
return 0;
}
/*
*/
