#include <iostream>
#include <algorithm>
using namespace std;

int main(void) {
    int N;
    cin >> N;
    int a[N];
    for (int i = 0; i < N; i++) {
        cin >> a[i];
    }

    for (int i = 0; i < N-1; i++) {
        int min = 1e+7;
        int minarg;
        for (int j = i+1; j < N; j++) {
            int daiyaku = a[j] / __gcd(a[i], a[j]);
            if (daiyaku < min) {
                min = daiyaku;
                minarg = j;
            } else if (daiyaku == min) {
                if (a[j] < a[minarg]) {
                    minarg = j;
                }
            }
        }
        int kari = a[i+1];
        a[i+1] = a[minarg];
        a[minarg] = kari;
    }

    for (int i = 0; i < N; i++) {
        cout << a[i] << " ";
    }
    cout << endl;

    return 0;
}