#include <stdio.h>
#include <math.h>

#define MAX_N 3500

int cmmdc, n, m;

int vine[MAX_N], prim[MAX_N];

double c[MAX_N];

void get_primes() {
	for (int i = 2; i <= m; i++) {
    	int ok = 1;

		for (int j = 2; j < i; j++)
			if (i % j == 0) {
            	ok = 0;
				break;
			}

		if (ok)
			prim[++prim[0]] = i;
	}

	
}

void write(int x) {
	if (x == 0) {
    	printf("\n");
		return;
	}

	printf("%d ", (x - vine[x])  * cmmdc);
	write(vine[x]);
}

int main() {

	freopen("nummst.in", "r", stdin);
	freopen("nummst.out", "w", stdout);

	scanf("%d", &n);
	
	for (int i = 2; i <= n; i++)
		if (n % i == 0) {
        	cmmdc = n / i;
            m = i;
			break;
		}

	get_primes();

	for (int i = 0; i <= m; i++) {
		c[i] = log(1);
    	vine[i] = i - 1;
	}

	for (int i = 1; i <= prim[0]; i++) {
		for (int j = m; j >= 1; j--) {
			for (int k = prim[i]; k <= j; k *= prim[i]) {
				if (c[j] < c[j - k] + log(k)) {
    				if (!(j == m && j - k == 0)) {
						c[j] = c[j - k] + log(k);
    	        		vine[j] = j - k;
					}
				}
			}

			if (c[j - 1] > c[j]) {
        		c[j] = c[j - 1];
				vine[j] = j - 1;
			}
		}
	}

	write(m);

	return 0;
}