#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <cstring>
using namespace std;
#define REP(i, n)           for(int(i)=0;(i)<(n);++(i))
typedef long long ll;

int N;
int a[10010];
const int GC = 500;
int g[GC][GC];

int gcd(int num1, int num2){
    if(num2 == 0) return num1;
    if(num1 < GC && num2 < GC){
        if(g[num1][num2]) return g[num1][num2];
        return g[num1][num2] = gcd(num2, num1 % num2);
    }
    return gcd(num2, num1 % num2);
}
int lcm(int num1, int num2){ return num1 / gcd(num1, num2) * num2; }

int main(){
    do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0);
    cin >> N;
    if(N > 10000){ cerr << "error" << endl; return 1; }
    REP(i,N){
        cin >> a[i];
        if(a[i] > 10000){ cerr << "error" << endl; return 1; }
    }
    sort(a+1, a+N);

    REP(i,N-1){
        int k = a[i], mini = -1, minv = 1<<29;
        for(int j = i+1; j < N; j++){
            if(minv < a[j]) break;
            int lc = lcm(k, a[j]);
            if(lc < minv || (lc == minv && a[j] < a[mini])){
                minv = lc; mini = j;
            }
        }
        if(mini < 0){ cerr << "error" << endl; return 1; }
        if(mini != i+1){
            int v = a[mini];
            memmove(a+i+2, a+i+1, (mini-i-1)*sizeof(a[0]));
            a[i+1] = v;
        }
    }

    REP(i,N-1) cout << a[i] << " "; cout << a[N-1] << endl;
    return 0;
}