#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> sieve(int n) {
  vector<long long> res(n);
  iota(res.begin(), res.end(), 0);
  for (int i = 2; i*i < n; ++i) {
    if (res[i] < i) continue;
    for (int j = i*i; j < n; j += i)
      if (res[j] == j) res[j] = i;
  }
  return res;
}

vector<long long> factor(int n, const vector<long long>& min_factor) {
  // min_factor は sieve() で得られたものとする
  vector<long long> res;
  while (n > 1) {
    res.push_back(min_factor[n]);
    n /= min_factor[n];
    // 割った後の値についても素因数を知っているので順次求まる
  }
  return res;
}
vector<long long> divisor(vector<long long> factor){
    int n=factor.size();
    vector<long long> ret={1};
    rep(i,n){
        int cnt=1,range=ret.size(),p=1;
        while(i+1<n&&factor[i]==factor[i+1]){
            cnt++;i++;
        }
        while(cnt--){
            p*=factor[i];
            rep(j,range)ret.pb(ret[j]*p);
        }
    }
    sort(ret.begin(),ret.end());
    return ret;
}

int main(){
    ll n;cin >> n;
    vl v(n);rep(i,n)cin >> v[i];
    vl minfac=sieve(10001);
    vector<multiset<ll>> st(10001);
    repl(i,1,n){
        vl fac=factor(v[i],minfac);
        for(auto p:divisor(fac)){
            st[p].ins(v[i]);
        }
    }
    vl ans;ans.pb(v[0]);
    repl(i,1,n){
        vl fac=factor(ans[i-1],minfac);
        vl div=divisor(fac);
        ll tmp=INF;
        ll ret=INF;
        rep(j,div.size()){
            if(st[div[j]].empty())continue;
            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);
        fac=factor(ret,minfac);
        for(auto p:divisor(fac)){
            st[p].erase(st[p].find(ret));
        }
    }
    rep(i,n)cout << ans[i] <<" ";cout << endl;
}