#include <cstdio>
#include <vector>
#include <algorithm>

/// VA URMA


using namespace std;

long long N;
vector<long long> divi;

void descomp()
{
    long long i;
    for(i = 2; i*i < N; ++i)
        if(N%i == 0)
        {
            divi.push_back(i);
            divi.push_back(N/i);
        }

   while(i*i < N) ++i;
   if(N % i == 0)
        divi.push_back(i);
   divi.push_back(N);
   sort(divi.begin(),divi.end());
}

int main()
{
    freopen("desc.in","r",stdin);
    freopen("desc.out","w",stdout);

    scanf("%lld",&N);
    descomp();

    return 0;
}