#include <atcoder/all>
#include <bits/stdc++.h>
using namespace std;
using namespace atcoder;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (ll i = (s); i < (ll)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for (ll i = (ll)(s - 1); i >= (ll)(e); i--)
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;

template <typename T, typename U>
bool chmax(T& a, const U& b) {
    if (a >= b) return false;
    a = b;
    return true;
}
template <typename T, typename U>
bool chmin(T& a, const U& b) {
    if (a <= b) return false;
    a = b;
    return true;
}

void yes_no(bool f, string yes = "Yes", string no = "No") { cout << (f ? yes : no) << "\n"; }

struct Sieve {
    vector<int> primes;
    vector<int> _isPrime;
    vector<int> prime_factor_num; // soinsuu no kosuu
    Sieve(int n) : _isPrime(n + 1, 1), prime_factor_num(n + 1, 0) {
        buildPrimes();
    }
    void buildPrimes() {
        _isPrime[0] = _isPrime[1] = 0;
        int n = _isPrime.size();
        REP(i, 2, n) {
            if (_isPrime[i]) {
                primes.push_back(i);
                prime_factor_num[i] = 1;
                for (int j = i + i; j < n; j += i) _isPrime[j] = 0, prime_factor_num[j]++;
            }
        }
    }
    bool isPrime(int i) {
        return _isPrime[i];
    }
};

void solve() {
    int n;
    cin >> n;
    vl a(n);
    rep(i, n) cin >> a[i];

    const int ma = (int)1e4 + 10;
    map<ll, ll> cnt;
    using P = pair<ll, ll>;
    vector<priority_queue<P, vector<P>, greater<P>>> v(ma);
    rep(i, n) {
        cnt[a[i]]++;
        for (ll j = 1; j * j <= a[i]; ++j)
            if (a[i] % j == 0) {
                v[j].emplace(a[i], i);
                v[a[i] / j].emplace(a[i], i);
            }
    }
    vl ans;
    rep(i, n) {
        ans.emplace_back(a[i]);
        cnt[a[i]]--;
        ll mi = 1e9, val;
        for (ll j = 1; j * j <= a[i]; ++j)
            if (a[i] % j == 0) {
                while (v[j].size()) {
                    auto [x, k] = v[j].top();
                    if (cnt[x] == 0) {
                        v[j].pop();
                        continue;
                    }
                    auto y = a[i] * x / __gcd(a[i], x);
                    if (chmin(mi, y)) {
                        val = x;
                    }
                    break;
                }
                while (v[a[i] / j].size()) {
                    auto [x, k] = v[a[i] / j].top();
                    if (cnt[x] == 0) {
                        v[a[i] / j].pop();
                        continue;
                    }
                    auto y = a[i] * x / __gcd(a[i], x);
                    if (chmin(mi, y)) {
                        val = x;
                    }
                    break;
                }
            }
        if (i + 1 < n)
            a[i + 1] = val;
    }
    rep(i, ans.size()) cout << ans[i] << (i + 1 == (int)ans.size() ? '\n' : ' ');
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t = 1;
    // cin >> t;
    rep(ti, t) solve();
    return 0;
}