#include <stdio.h>
#include <stdlib.h>
#define Maxsize 10000

int main(int argc, char const *argv[])
{
	int k,start,stop,N,count,max,Max,j;
	max = count = Max = j = 0 ;
	k=2;
	int A[Maxsize] ={0};

	scanf("%d",&N);
	while(k<N)
	{
		if (N % k == 0)//将因子映射到一维数组中
		{
		   A[k]=k;
		   A[N/k]=(N/k);
		}

		k++;
	}
	for (j; j < Maxsize; ++j)
{
     int i=j;//字符串暴力匹配的思想，用i来记录第一次匹配的起始位
    count = 0 ;
	for (; A[i]!=0; ++i)
	{
		count ++;
	}
	max = count ;
	if (Max < max)
	{
		start = j ;//用start来记录最长连续子串起始位
		Max = max ;
	}
}
for (start; A[start] != 0; ++start)
{
	printf("%d ",A[start]);
}
	return 0;
}