#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

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

int lcm(int a,int b){
    return a/gcd(a,b)*b;
}

int main(){
    int n,a[SIZE],minlcm,mina,mini,l;
    vector<int> ans;
    
    scanf("%d",&n);
    
    for(int i=0;i<n;i++){
        scanf("%d",&a[i]);
    }
    
    ans.push_back(a[0]);
    
    for(int i=0;i<n-1;i++){
        
        minlcm = mina = INF;
        
        for(int j=i+1;j<n;j++){
            
            l = lcm(a[i],a[j]);
            
            if(minlcm>l || (minlcm==l && mina>a[j])){
                minlcm = l;
                mina = a[j];
                mini = j;
            }
        }
        
        ans.push_back(a[mini]);
        swap(a[mini],a[i+1]);
        
    }
    
    for(int i=0;i<ans.size();i++){
        printf(i<ans.size()-1?"%d ":"%d\n",ans[i]);
    }
    
    return 0;
}