#include <iostream>
#include <queue>
#include <utility>
#include <vector>

using namespace std;

int N;
int A[10000];
bool used[10000];
vector<int> ds[10000];
priority_queue<pair<int, int> > P[10001];

int main() {
	cin >> N;
	for (int i = 0; i < N; i++) {
		cin >> A[i];
		for (int d = 1; d * d <= A[i]; d++) {
			if (A[i] % d == 0) {
				P[d].push(make_pair(-(10000 * (A[i] / d) + A[i]), i));
				P[A[i] / d].push(make_pair(-(10000 * d + A[i]), i));
				ds[i].push_back(d);
				ds[i].push_back(A[i] / d);
			}
		}
	}
	int prev = 0;
	used[0] = true;
	cout << A[0];
	for (int i = 1; i < N; i++) {
		int best = -1000000000;
		int bestIdx = -1;
		for (const int& d : ds[prev]) {
			while (!P[d].empty() && used[P[d].top().second]) {
				P[d].pop();
			}
			if (!P[d].empty()) {
				pair<int, int> p = P[d].top();
				if (p.first > best) {
					best = p.first;
					bestIdx = p.second;
				}
			}
		}
		used[bestIdx] = true;
		prev = bestIdx;
		cout << " " << A[bestIdx];
	}
	cout << endl;
	return 0;
}