#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
//#include <array>
#include <list>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
LL gcd(LL a,LL b){
	return b ? gcd(b,a%b) : a;
}
const int Amax = 10001;
int Ymax=0;
int A[Amax];

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	int N;
	cin>>N;
	vector<int> ans(N);
	int ansCount = 1;
	
	cin>>ans[0];
	int temp;
	for(int i=0;i<N-1;++i){
		cin>>temp;
		Ymax = max(Ymax,temp+1);
		++A[temp];
	}
	int count = 1;
	int min = 1;
	int it = 1;
	bool flag = true;
	while( ansCount < N ){
		for(count = min; count<Ymax; ++count){
			if( A[count] ){
				min = count;
				break;
			}
		}

		if( ans[ansCount-1] == 1){//?
			ans[ansCount] = min;
			--A[min];
			++ansCount;
			flag = true;
			continue;
		}
		int tempA,tempB;
		if( flag && ans[ansCount-1] < min ){
			//for(int i= ans[ansCount-1];i<Ymax;i+=i ){
			for(int i= ans[ansCount-1];flag && i<Ymax;i+= ans[ansCount-1] ){
				if( A[i] ){
					/*while(A[i]){
						ans[ansCount] = i;
						++ansCount;
						--A[i];
					}*/
					tempA = i;
					flag = false;
				}
			}
			flag = false;
		}
		LL ssk;
		int minID = min;
		{
			ssk = ans[ansCount-1]/gcd(ans[ansCount-1],minID)*minID;
			LL temp;
			for(count = min; count < ssk && count<Ymax; ++count){
				if( A[count] ){
					temp = ans[ansCount-1]/gcd(ans[ansCount-1],count)*count;
					if( temp < ssk){
						ssk = temp;
						minID = count;
					}
				}
			}
			tempB = minID;
			/*
			if( ans[ansCount-1] == minID ){
				while( A[minID] ){
					ans[ansCount] = minID;
					++ansCount;
					--A[minID];
				}
			}else{
				ans[ansCount] = minID;
				++ansCount;
				--A[minID];
			}*/
			flag = true;
		}
		if( ssk < ans[ansCount-1]/gcd(ans[ansCount-1],tempB)*tempB ){
			if( ans[ansCount-1] == minID ){
				while( A[minID] ){
					ans[ansCount] = minID;
					++ansCount;
					--A[minID];
				}
			}else{
				ans[ansCount] = minID;
				++ansCount;
				--A[minID];
			}
		}else{//tempA
			while(A[tempB]){
				ans[ansCount] = tempB;
				++ansCount;
				--A[tempB];
			}
		}
	}
	
	vector<int>::iterator titr;
	titr = ans.begin();
	while( titr != ans.end() ){
		cout << *titr;
		if( titr+1 != ans.end() ){
			cout << ' ';
		}
		++titr;
	}cout << '\n';
	return 0;
}