#include<iostream>
#include<fstream>
#include<sstream>
#include<string>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<stack>
#include<queue>
#include<set>
#include<map>
#include<vector>
#include<list>
#include<algorithm>
#include<utility>
#include<complex>
#include<functional>
using namespace std;

//(1/約数,元の数)
typedef pair<int, int> P;


vector <list<int>> sorted(10001);
vector<list<int>>divisor(10000);
int main(void){
	int N;
	int A[10000];

	cin >> N;
	
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
	}
	sort(A + 1, A + N);
	
	for (int i = 0; i <N; i++)
	{
		for (int j = 1; j*j <= A[i]; j++)
		{
			if (A[i] % j == 0){
				divisor[i].push_back(j);
				sorted[j].push_back(i);
				if (j*j != A[i]){
					divisor[i].push_back(A[i] / j);
					sorted[A[i] / j].push_back(i);
				}
			}
		}
	}
	
	int now = 0;
	for (int i = 0; i < N-1; i++)
	{
		cout << A[now] << " ";
		int pivot = A[now];
		A[now] = -1;
		P res = make_pair(100000000, 10000);
		for (auto &div : divisor[now])
		{
		   // cout<<"("<<div;
			while ((sorted[div].empty()==false) && (A[sorted[div].front()] == -1))
				sorted[div].pop_front();
			if (sorted[div].empty())continue;
			int k = sorted[div].front();
			res = min(res, make_pair(pivot*(A[k] / div), sorted[div].front()));
			//cout << "("<<A[k];
		}

		now = res.second;
		//cout << endl;
	}
	cout << A[now]<< endl;


	return 0;
}