#include <iostream>
#include <vector>
#include <set>
using namespace std;

vector<int> divisors[10010];
void getDivisors(int n, vector<int>& store){
    for(int d=1;d*d<=n;d++)if(n % d == 0){
        store.push_back(d);
        if(d != n / d){
            store.push_back(n / d);
        }
    }
}

set<pair<int, int>> div_grp[10010];
int a[10010];

int main(){
    int N;
    cin >> N;

    for(int i=0;i<N;i++){
        cin >> a[i];
        getDivisors(a[i], divisors[i]);
    
        for(int d : divisors[i]){
            div_grp[d].insert(make_pair(a[i], i));
        }
    }
    
    cout << a[0];
    
    int prev_id = 0;
    for(int t=1;t<N;t++){
        int mini_v = 1 << 30;
        int mini_k = -1;
        
        auto prev = make_pair(a[prev_id], prev_id);
        for(int d : divisors[prev_id]){
            div_grp[d].erase(prev);
        
            if(!div_grp[d].empty()){
                auto now = *div_grp[d].begin();
                int now_v = now.first / d;
                
                if(now_v < mini_v){
                    mini_v = now_v;
                    mini_k = now.second;
                } else if(now_v == mini_v && now.first < a[mini_k]){
                    mini_k = now.second;
                }
            }
        }
        
        
        cout << " " << a[mini_k];
        prev_id = mini_k;
    }
    
    return 0;
}