#include <cstdio>
#include <iostream>
#include <algorithm>

int N, A[10000];

int main(){
    scanf("%d", &N);
    for(int i=0;i<N;i++){scanf("%d", A+i);}

    for(int i=1;i<N;i++){
        int mn = 1001001001, mn_v = 1001001001;
        for(int j=i;j<N;j++){
            int x = A[j] / std::__gcd(A[j], A[i-1]);
            if(x < mn_v || x == mn_v && A[j] < A[mn]){
                mn_v = x;
                mn = j;
            }
        }
        std::swap(A[i], A[mn]);
    }

    for(int i=0;i<N;i++){
        if(i == N-1){printf("%d\n", A[i]);}
        else{printf("%d ", A[i]);}
    }
}