#include<bits/stdc++.h>
using namespace std;
using ll = long long;

int gcd(int a,int b){
    if(a<b) swap(a,b);
    if(b==0) return a;
    return gcd(b,a%b);
}

int main(){
    int n;
    cin>>n;
    vector<int> a(n);
    for(int i = 0;i<n;i++) cin>>a[i];
    for(int i = 0;i<n-1;i++){
        int l = 1e8;
        int ni = -1;
        for(int j = i + 1;j<n;j++){
            int now = a[i] * a[j] / gcd(a[i],a[j]);
            if(now<l){
                l = now;
                ni = j;
            }else if(now==l){
                if(a[ni]>a[j]) ni = j;
            }
        }
        swap(a[i+1],a[ni]);
    }
    for(int i = 0;i<n;i++){
        if(i!=0) cout<<" ";
        cout<<a[i];
    }
    cout<<endl;
}