#include <bits/stdc++.h>

#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define RFOR(i, a, b) for (ll i = (b)-1; i >= (a); i--)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep1(i, n) for (ll i = 1; i <= (n); i++)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; i--)

#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define show(x) cout << #x << " = " << x << endl
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define pii pair<int, int>
#define vi vector<int>

using namespace std;
template <class S, class T>
ostream& operator<<(ostream& o, const pair<S, T>& p)
{
    return o << "(" << p.first << "," << p.second << ")";
}
template <class T>
ostream& operator<<(ostream& o, const vector<T>& vc)
{
    o << "sz = " << vc.size() << endl
      << "[";
    for (const T& v : vc)
        o << v << ",";
    o << "]";
    return o;
}
using ll = long long;
constexpr ll MOD = 1000000007;

constexpr int MAX = 10000;
int a[MAX];
vector<int> divs[MAX];
set<pii> mul[MAX + 1];

int main()
{
    int n;
    cin >> n;
    rep(i, n)
    {
        cin >> a[i];
        for (int d = 1; d * d <= a[i]; d++) {
            if (a[i] % d == 0) {
                if (d * d == a[i]) {
                    divs[i].pb(d);
                    mul[d].insert(mp(a[i], i));
                } else {
                    divs[i].pb(d);
                    divs[i].pb(a[i] / d);
                    mul[d].insert(mp(a[i], i));
                    mul[a[i] / d].insert(mp(a[i], i));
                }
            }
        }
    }

    vector<int> ans(n);
    ans[0] = 0;
    rep1(i, n - 1)
    {
        int prev = ans[i - 1];
        for (int d : divs[prev]) {
            mul[d].erase(mp(a[prev], prev));
        }
        int mini = numeric_limits<int>::max();
        int min_m = -1;

        for (const int d : divs[prev]) {
            if (not mul[d].empty()) {
                const auto e = *(mul[d].begin());
                const int m = e.first;
                const int m_ind = e.second;
                if (mini > a[prev] * m / d) {
                    mini = a[prev] * m / d;
                    min_m = m_ind;
                } else if (mini == a[prev] * m / d) {
                    if (a[min_m] > a[m_ind]) {
                        min_m = m_ind;
                    }
                }
            }
        }
        ans[i] = min_m;
    }
    rep(i, n)
    {
        if (i > 0) {
            cout << " ";
        }
        cout << a[ans[i]];
    }
    cout << endl;
    return 0;
}