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

int main() {
    int N, A[10010];
    cin >> N;
    for (int i = 0; i < N; i++)
        cin >> A[i];

    vector<int> yakusuu[10010];
    multiset<int> S[10010];
    for (int i = 1; i <= 10000; i++) {
        for (int x = 1; x * x <= i; x++) {
            if (i % x == 0) {
                yakusuu[i].push_back(x);
                if (x * x != i)
                    yakusuu[i].push_back(i / x);
            }
        }
    }

    for (int i = 0; i < N; i++) {
        for (auto& x : yakusuu[A[i]])
            S[x].insert(A[i]);
    }

    vector<int> ans;
    ans.push_back(A[0]);
    int nxt = A[0];
    while (ans.size() != N) {
        int MIN = 1e8 + 10, cur = 1e5;

        for (auto& x : yakusuu[nxt]) {
            S[x].erase(S[x].find(nxt));
            if (!S[x].empty()) {
                if (MIN > *S[x].begin() * nxt / x || (MIN == *S[x].begin() * nxt / x) && *S[x].begin() < cur) {
                    cur = *S[x].begin();
                    MIN = *S[x].begin() * nxt / x;
                }
            }
        }

        ans.push_back(cur);
        nxt = cur;
    }

    for (auto& x : ans) {
        cout << x << " ";
    }
    cout << endl;
}