#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=n-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
vector<long long> divisor(long long n) {
    vector<long long> ret;
    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(ret.begin(), ret.end()); // 昇順に並べる
    return ret;
}
int main(){
    ll n;cin >> n;
    vl v(n);rep(i,n)cin >> v[i];
    vector<multiset<ll>> st(10001);
    repl(i,1,n){
        for(auto p:divisor(v[i])){
            st[p].ins(v[i]);
        }
    }
    /*rep(i,10){
        for(auto p:st[i])cout << p <<" " ;cout <<endl;
    }*/
    vl ans;ans.pb(v[0]);
    repl(i,1,n){
        vl div=divisor(ans[i-1]);
        ll tmp=INF;
        ll ret=INF;
        rep(j,div.size()){
            if(st[div[j]].empty())continue;
            //cout << *st[div[j]].begin() <<" " << ans[i-1] <<" " << div[j] <<endl;
            if(tmp==*st[div[j]].begin()*ans[i-1]/div[j]){
                chmin(ret,*st[div[j]].begin());
            }
            else if(tmp>*st[div[j]].begin()*ans[i-1]/div[j]){
                tmp=*st[div[j]].begin()*ans[i-1]/div[j];
                ret=*st[div[j]].begin();
            }
        }
        ans.pb(ret);
        for(auto p:divisor(ret)){
            st[p].erase(st[p].find(ret));
        }
        /*
        cout << ret <<endl;
        rep(j,10){
            cout << j <<": ";
            for(auto p:st[j])cout << p <<" " ;cout <<endl;
        }//*/
    }
    rep(i,n)cout << ans[i] <<" ";cout << endl;
}