#include <bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=10010;
ll a[N];
vector<ll> divs[N];
vector<multiset<ll>> mul;
void pre(){
    for(ll i=1;i<N;i++){
        for(ll j=i;j<N;j+=i){
            divs[j].emplace_back(i);
        }
    }
}
void solve(){
    pre();
    ll n;cin>>n;
    for(ll i=0;i<n;++i)cin>>a[i];
    const ll mx=*max_element(a,a+n);

    mul.resize(mx+1);

    for(ll i=1;i<n;++i){
        for(ll d:divs[a[i]]){
            mul[d].emplace(a[i]);
        }
    }
    for(ll i=1;i<=mx;++i)mul[i].emplace(1000000010);

    vector<ll> ans{(ll)a[0]};
    ll e=a[0]; 
    for(ll i=1;i<n;++i){
        ll best_lcm=1e9+10;
        ll a=-1;
        for(ll d:divs[e]){
            auto x=*mul[d].begin(); 
            ll lc=e*x/d;
            if(best_lcm>lc){
                best_lcm=lc;
                a=x;
            }
        }
        ans.emplace_back(a);
        for(ll d:divs[a]){
            auto it=mul[d].find(a);
            mul[d].erase(it);
        }
        e=a;
    }
    for(ll &x:ans)cout<<x<<' '; 
}
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    int T=1; //cin>>T;
    while(T--)solve();
    return 0;
}