import java.util.Scanner;
public class ZhiNum {
public static void main(String[] args) {
Scanner sc=new Scanner(System.in);
int in=sc.nextInt();
factor(in);
}
private static void factor(int number) {
for(int i=2;i<number;i++)
{
if(number%i==0)
{
System.out.print(i+" ");
if(isPrime(number/i))
{
System.out.print(number/i+" ");
}
else{
factor(number/i);
}
return;
}
}
}
private static boolean isPrime(int number) {
for(int i=2;i<number;i++)
{
if(number%i==0)
{
return false;
}
}
return true;
}
}
1-10000以内の素数を見つける
public class Zhinum1 {
public static void main(String[]args){
for(int i=2;i<10000;i++){
for(int j=2;j<=i;j++){
if(i%j==0&&i!=j)
{
break;
}
if(i%j==0&&i==j)
{
System.out.println(i);
}
}
}
}
}