#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int>P;
typedef pair<ll,ll>pll;

const int MAX_N = 10005;

set<P> st[MAX_N];
vector<vector<ll> > res;

vector<ll> divisor(ll n)
{
    vector<ll> res;
    for(ll i=1;i*i<=n;i++){
        if(n%i==0){
            res.pb(i);
            if(i != n/i){
                res.pb(n/i);
            }
        }
    }
    sort(all(res));
    return res;
}

ll gcd(ll a,ll b)
{
    if(a % b == 0){
        return b;
    }else{
        return gcd(b,a%b);
    }
}

ll lcm(ll a,ll b)
{
    return  a / gcd(a,b) * b;
}

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vector<int> vec(n);
    rep(i,n){
        cin >> vec[i];
        res.pb(divisor(vec[i]));
        rep(j,res[i].size()){
            st[res[i][j]].insert(P(vec[i],i));
        }
    }
    vector<int> v;
    v.pb(vec[0]);
    int i = 0;
    rep(id,n-1){
        pll ans = pll((1LL << 60),INF);
        int idx;
        rep(j,res[i].size()){
            st[res[i][j]].erase(P(vec[i],i));
            auto it = st[res[i][j]].begin();
            if(it != st[res[i][j]].end()){
                P p = *it;
                if(ans > pll(lcm(vec[i],p.fi),vec[i])){
                    ans = pll(lcm(vec[i],p.fi),vec[i]);
                    idx = p.se;
                }
            }
        }
        i = idx;
        v.pb(vec[i]);
    }
    rep(i,n-1){
        cout << v[i] << " ";
    }
    cout << v[n-1] << endl;
    return 0;
}