#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>
#include <iomanip>

using namespace std;

#define REP(i, n) for(ll i = 0;i < n;i++)
#define REPR(i, n) for(ll i = n;i >= 0;i--)
#define FOR(i, m, n) for(ll i = m;i < n;i++)
#define FORR(i, m, n) for(ll i = m;i >= n;i--)
#define REPO(i, n) for(ll i = 1;i <= n;i++)
#define ll long long
#define INF (ll)1 << 60
#define MINF (-1 * INF)
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007
#define P pair<ll, ll>


int n, s[11000];

int gcd(int a, int b) {
	return (b == 0 ? a : gcd(b, a % b));
}

int lcm(int a, int b) {
	return a / gcd(a, b) * b;
}
int main() {
	cin >> n;
	REP(i, n)cin >> s[i];
	
	REP(i, n - 1) {
		int ma = 1e9, man;
		printf("%d ", s[i]);
		FOR(j, i + 1, n) {
			int now = s[i] / gcd(s[i], s[j]) * s[j];
			if (ma > now or ((ma == now) and s[man] > s[j])) {
				ma = now;
				man = j;
			}
		}
		swap(s[i + 1], s[man]);
	}
	printf("%d\n", s[n - 1]);
}