#include<cstdio>
#include<algorithm>
#include<random>
#define fo(i,x,y) for(int i = x;i <= y;++i)
#define fd(i,x,y) for(int i = x;i >= y;--i)
#define i128 __int128_t
#define f128 __float128
#define sub(x,y) (x < y ? x + n - y : x - y)
using namespace std;
i128 n,f[130];
mt19937_64 gen(114514);
inline i128 mul(i128 x,i128 y,i128 n)
{
	i128 z = x * y - (i128)((f128)(x) * y / n) * n;
	if(z > n) z -= n;
	return z < 0 ? z + n : z;
}
i128 ksm(i128 x,i128 y,i128 n)
{
	i128 res = 1;
	for(;y;y >>= 1,x = mul(x,x,n)) if(y & 1) res = mul(res,x,n);
	return res;
}
bool wit(i128 a,i128 n)
{
	i128 u = n - 1,t = 0;
	while(u + 1 & 1) u >>= 1,++t;
	a = ksm(a,u,n);
	fo(i,1,t)
	{
		i128 A = mul(a,a,n);
		if(A == 1) return a == 1 || a == n - 1;
		a = A;
	}
	return a == 1;
}
bool mr(i128 n)
{
	if(n < 2) return 0;
	if(n == 2) return 1;
	fo(i,1,20)
	{
		i128 a = gen() % (n - 2) + 2;
		if(wit(a,n) == 0) return 0;
	}
	return 1;
}
inline i128 F(i128 x,i128 c,i128 n)
{
	i128 res = mul(x,x,n) + c;
	return res < n ? res : res - n;
}
void factor(i128 n)
{
	if(n == 1) return;
	if(n + 1 & 1) {f[++f[0]] = 2;return factor(n >> 1);}
	if(mr(n)) {f[++f[0]] = n;return;}
	while(1)
	{
		fprintf(stderr,"-1\n");
		i128 c = gen() % (n - 1) + 1,x = gen() % (n - 1) + 1,y = x,M = 1;
		while(1)
		{
			fo(i,0,127)
			{
				x = F(x,c,n),y = F(F(y,c,n),c,n),M = mul(sub(x,y),M,n);
				if(M == 0) break;
			}
			if(M == 0) break;
			i128 g = __gcd(M,n);
			if(g >= 2 && g <= n - 1)
			{
				factor(g),factor(n / g);return;
			}
		}
	}
}
#define gc getchar
#define pc putchar
i128 rd()
{
	i128 x = 0;char ch = gc();
	while(ch < 48 || ch > 57) ch = gc();
	while(ch >= 48 && ch <= 57) x = x * 10 + ch - 48,ch = gc();
	return x;
}
void pr(i128 x)
{
	char ch[40];int w = -1;
	if(x == 0) ch[++w] = 48;
	while(x) ch[++w] = x % 10 + 48,x /= 10;
	fd(i,w,0) pc(ch[i]);pc(' ');
}
int main()
{
	n = rd(),factor(n),sort(f + 1,f + f[0] + 1);
	fo(i,1,f[0]) pr(f[i]);
}