#include <bits/stdc++.h>
#define DIM 5000
#define DIMM 10000010
using namespace std;

ifstream fin ("nummst.in");
ofstream fout ("nummst.out");
int ciur[DIM*2],p[DIM];
int sol[700][DIM];
double dp[700][DIM];
vector <int> ans;
int n,i,j,k,d,nr;
int main (){

    fin>>n;

    for (i=2;i<=n/i;i++)
        if (n%i == 0)
            break;
    d = n/i;
    n = i;

    for (i=2;i<n;i++){
        if (!ciur[i]){
            for (j=i+i;j<=n;j+=i)
                ciur[j] = 1;
            p[++k] = i;
        }
    }

    /// dp[i][j] - cmmmc ul maxim daca il scriu pe i ca suma de puteri de nr prime
    /// cu factori primi din primii j


    //dp[0][0] = log(1);

    for (j=1;j<=k;j++){

        /// nu iau nimic de la factorul asta
        for (i=1;i<=n;i++)
            dp[i][j] = dp[i][j-1];

        int nr = p[j];
        while (nr <= n){

            for (i=nr;i<=n;i++){

                if (dp[i-nr][j-1] + log(nr) > dp[i][j]){
                    dp[i][j] = dp[i-nr][j-1] + log(nr);
                    sol[i][j] = nr; /// tin minte din ce obtin starea i,j
                }
            }

            nr *= p[j];
        }
    }

    /*double maxi = 0;
    int poz = 0;
    for (i=1;i<=k;i++){
        if (dp[n][i] > maxi){
            maxi = dp[n][i];
            poz = i;
        }
    }*/

    int x = n, poz = k;
    while (poz > 0){
        if (sol[x][poz]){
            ans.push_back(sol[x][poz]*d);
            x -= sol[x][poz];
        }
        poz--;
    }
    while (x > 0){ /// trb sa ma asigur ca suma da n
        ans.push_back(d);
        x--;
    }

    sort (ans.begin(),ans.end());
    for (auto it:ans)
        fout<<it<<" ";


    return 0;
}