/*   /\_/\
    (= ._.)
    / >0  \>1
*/
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

bool check (ll x)
{
  for (ll i = 2; i <= sqrt(x); ++i)
  if (x % i == 0) return false;
  return x > 1;
}
ll n;
int main()  
{
  freopen("uocnguyento.inp" , "r" , stdin);
  freopen("uocnguyento.out" , "w" , stdout);

  ios::sync_with_stdio(false);
  cin.tie(0);

  cin >> n;
  for (ll i = 1; i <= n; ++i)
  {
    if (check(i) and n % i == 0) cout << i << " ";
  }
  return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N=1e6+5;
bool prime[N];
void sieve(){
	memset(prime,true,sizeof(prime));
	prime[1]=prime[0]=false;
	for(int i=2;i*i<=N-5;i++){
		if(prime[i]){
			for(int j=i*i;j<=N-5;j+=i){
				prime[j]=false;
			}
		}
	}
}

signed main(){
	freopen("uocnguyento.inp","r",stdin);
	freopen("uocnguyento.out","w",stdout);
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int n;
	cin>>n;
	int sq=sqrt(n);
	sieve();
	vector<int>vt;
	for(int i=1;i*i<=n;i++){
		if(n%i==0){
			if(i!=n/i&&prime[n/i]){
				vt.push_back(n/i);
			}
			if(prime[i]){
				vt.push_back(i);
			}
		}
	}
	sort(vt.begin(),vt.end());
	for(int i=0;i<vt.size();i++){
		cout<<vt[i]<<" ";
	}
}
//By aerial