#include<cstdio>
#include <vector>
#include <string>
#include <string.h>
#include<iostream>
#include <queue>
#include<algorithm>
using namespace std;
const int maxn=100+5;

int a[maxn];
int b[maxn];

int main()
{
	int n;
	while(cin>>n)
	{
		fill(b,b+maxn,1);
		fill(a,a+maxn,0);
		int index=0,temp=0;
		int maxx=0,en=0;
		for(int i=2;i<=n;i++)
		{
			if(n%i==0)
			{
				a[index]=i;
				if(temp==i-1)
					b[index]=b[index-1]+1;
				if(b[index]>maxx)
				{
					maxx=b[index];
					en=i;
				}
				temp=i;
				index++;
			}
		}
		if(maxx==1)
			cout<<a[0];
		else
			for(int j=en-maxx+1;j<=en;j++)
				cout<<j<<" ";
		cout<<endl;
	}
}