#include<bits/stdc++.h>
using namespace std;


long long prime[10000009],T;
bool isp[10000009];
void precalc()
{
    long long i,j;
    T=0;
    for(i=2;i<=10000000;i++)
    {
        if(isp[i]==false)
        {
            for(j=i*i;j<=10000000;j+=i)
            {
                isp[j]=true;
            }
            prime[T]=i;
            T++;
        }
    }
}

int main()
{
    long long N,i,j,k,l;
    vector<long long>FACTORS;
    FACTORS.clear();

    precalc();

    cin>>N;

    for(i=0;i<T && prime[i]*prime[i]<=N;i++)
    {

        while(N%prime[i]==0)
        {
            N/=prime[i];
            FACTORS.push_back(prime[i]);

        }

    }

    if(N>1) FACTORS.push_back(N);

    for(i=0;i<FACTORS.size();i++) cout<<FACTORS[i]<<" ";
    cout<<endl;



    return 0;
}