#include<iostream>
#include<cstdio>
#include<algorithm>
#define N  100002
#define NN 100000
using namespace std;
typedef long long ll;
int prime[N],vis[N],s,ans,k,st[N],tot;
bool pd(int x){if(x==1) return false;if(x<=NN) return !vis[x];for(int i=1;i<=tot&&(ll)prime[i]*prime[i]<=x;i++)if(x%prime[i]==0) return false;return true;
}
void dfs(int la,int num,int num1){if(num==1){st[++ans]=num1;return;}if(num-1>prime[la]&&pd(num-1))st[++ans]=(num-1)*num1;for(int i=la+1;i<=tot&&prime[i]*prime[i]<=num;++i)for(ll j=prime[i],t=prime[i]+1;t<=num;j*=prime[i],t+=j){if(num%t==0)dfs(i,num/t,num1*j);}
}
int main(){for(int i=2;i<=NN;++i){if(!vis[i])prime[++tot]=i;for(int j=1;j<=tot&&(k=i*prime[j])<=NN;++j){vis[k]=1;if(i%prime[j]==0)break;}}while(scanf("%d",&s)!=EOF){ans=0;dfs(0,s,1);printf("%d\n",ans);sort(st+1,st+ans+1);if(ans){for(int i=1;i<=ans;++i)printf("%d ",st[i]);printf("\n");}}return 0;
}

#include<iostream>
#include<cstdio>
#include<algorithm>
#define N  100002
#define NN 100000
using namespace std;
typedef long long ll;
int prime[N],vis[N],s,ans,k,st[N],tot;
bool pd(int x){if(x==1) return false;if(x<=NN) return !vis[x];for(int i=1;i<=tot&&(ll)prime[i]*prime[i]<=x;i++)if(x%prime[i]==0) return false;return true;
}
void dfs(int la,int num,int num1){if(num==1){st[++ans]=num1;return;}if(num-1>prime[la]&&pd(num-1))st[++ans]=(num-1)*num1;for(int i=la+1;i<=tot&&prime[i]*prime[i]<=num;++i)for(ll j=prime[i],t=prime[i]+1;t<=num;j*=prime[i],t+=j){if(num%t==0)dfs(i,num/t,num1*j);}
}
int main(){for(int i=2;i<=NN;++i){if(!vis[i])prime[++tot]=i;for(int j=1;j<=tot&&(k=i*prime[j])<=NN;++j){vis[k]=1;if(i%prime[j]==0)break;}}while(scanf("%d",&s)!=EOF){ans=0;dfs(0,s,1);printf("%d\n",ans);sort(st+1,st+ans+1);if(ans){for(int i=1;i<=ans;++i)printf("%d ",st[i]);printf("\n");}}return 0;
}