#include "bits/stdc++.h"
using namespace std;

int dp[10001];
int m[10001];

int main() {
	int N;
	cin >> N;
	vector<int> A(N);
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
		m[A[i]]++;
	}
	int next = A[0];
	m[next]--;
	cout << next;
	for (int i = 0; i < N - 1; i++)
	{
		vector<int> divisor;
		for (int j = 1; j <= next; j++)
		{
			if (next % j == 0){
				divisor.push_back(j);
				if(j * j != next) divisor.push_back(next / j);
			}
		}
		sort(divisor.begin(), divisor.end());
		int check = 99999;
		int ans = 0;
		for (auto d: divisor)
		{
			while (d * dp[d] <= 10000){
				if (m[d * dp[d]]){
					if (dp[d] < check){
						ans = d * dp[d];
						check = dp[d];
					}
					break;
				}
				else dp[d]++;
			}
		}
		
		next = ans;
		m[next]--;
		cout << " " << next;
	}
	cout << endl;
}