#include<iostream>
using namespace std;
#include <string>
#include <vector>
#include <map>
#include<algorithm>

void SaveToMap(vector<int> &temp,map<int,vector<int>> &MP,int &curMax){
	if (temp.empty()) return;
	MP.insert(pair<int,vector<int>>(temp.size(),temp));
	if (temp.size()>curMax) curMax=temp.size();
	temp.clear();
}


int main(){
	vector<int> result;
	int input_val;
	cin>>input_val;
	map<int,vector<int>> MP;
	int count=0;
	vector<int> temp;
	int curMax=0;
	for (int i=2;i<input_val;i++){
		if (input_val%i==0){
			temp.push_back(i);
		}else{
			SaveToMap(temp,MP,curMax);
		}
	}
	for (map<int,vector<int>>::iterator it=MP.begin();it!=MP.end();it++){
		if (it->first==curMax) {
			result = it->second;
			break;
		}
	}
	for (int i=0;i<result.size();i++){
		if (i>0) cout<<" ";
		cout <<result[i];
	}
...