//暴力
#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm> 
#include<string>
#include<cstring>
using namespace std;
int main()
{
    int n;
    cin >> n;
    int best_seq[1000] = { 0 };
    int curr_seq[1000] = { 0 };
    int best_len = 0;
    int curr_len = 0; 
    for (int start = 2; start <= n; start++) {
        curr_len = 0;
        int num = start;
        
        while (n % num == 0) {
            curr_seq[curr_len] = num;
            curr_len++;
            num++;
        }
        if (curr_len > best_len) {
            best_len = curr_len;
            for (int i = 0; i < curr_len; i++) {
                best_seq[i] = curr_seq[i];
            }
        }
    }
    for (int i = 0; i < best_len; i++) {
        cout << best_seq[i] << " ";
    }

    return 0;
}

//优化
#include<iostream>
#include<cstdio>
#include<cmath>
#include<...