#include<iostream>
#include<cstring>
#include<map>
#include<cstdio>
#include<set>
#include<algorithm>
#include<vector>
using namespace std;

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

map<int,int> ma;
vector<int> ans;

int n;

int main() {
    cin.sync_with_stdio(false);
    cin >> n;
    for (int i = 0; i < n * n; i++) {
        int x;
        cin >> x;
        ma[-x]++;
    }

    if (n == 1) {
        cout << -ma.begin()->first << endl;
        return 0;
    }
    auto it=ma.begin();
    while(it!=ma.end()) {
        while (it != ma.end() && it->second == 0)it++;
        if(it==ma.end())break;
        it->second--;
        for (auto c:ans)ma[-gcd(c, -it->first)] -= 2;
        ans.push_back(-it->first);
    }
    for (auto c:ans)
        cout << c << " ";
    cout << endl;
    return 0;
}