#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cmath>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <cstring>

typedef long long ll;
using namespace std;

#define mod 1000003
#define INF 1000000000
#define LLINF 2000000000000000000LL

#define SIZE 10000

vector<int> factor(int n){
    vector<int> ret,ret2;
    
    for(int i=1;i*i<=n;i++){
        if(n%i==0){
            ret.push_back(i);
            
            if(i*i<n)
                ret.push_back(n/i);
        }
    }
    
    for(int i=0;i<ret2.size();i++){
        ret.push_back(ret2[ret2.size()-1-i]);
    }
    
    return ret;
}

int main(){
    int n,a[SIZE],k[SIZE+1],now,min=INF;
    vector<int> fac,ans;
    
    scanf("%d",&n);
    
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
        k[a[i]]++;
    }

    k[a[0]]--;
    now = a[0];
    ans.push_back(a[0]);
    
    for(int i=0;i<n-1;i++){
        
        bool f = true;
        
        for(int l=1;;l++){
            vector<int> fac = factor(now*l);

            for(int j=0;j<fac.size();j++){
                if(k[fac[j]]>0){
                    ans.push_back(fac[j]);
                    k[fac[j]]--;
                    now = fac[j];
                    f = false;
                    break;
                }
            }
            if(!f) break;
        }
        
    }
    
    for(int i=0;i<ans.size();i++){
        printf(i<ans.size()-1?"%d ":"%d\n",ans[i]);
    }
    
    return 0;
}