#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

//#define pb push_back
//#define puts(x) cout << #x << " : " << x << endl;
//#pragma GCC diagnostic ignored "-Wconversion"
//#define REP(i,n) for (int i=0;i<(n);i++)
//#define REPE(i,n) for (int i=0;i<=(n);i++)
//#define init(a,b) memset((a), (b), (sizeof(a)));
//#define PI 3.14159265
//#define EPS (1e-10)
//#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

typedef long long ll;
//#define int long long

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    return gcd(b, a % b);
}

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

int a[10005];
vector<int> divs[10005]; // i, a,b,c,d,...
set<pair<int, int> > s[10005]; // div, a[i], i

signed main() {
    int n;
    cin>>n;
    for(int i=0;i<n;i++)cin>>a[i];

    for(int k=0;k<n;k++){
        for(int i=1;i*i<=a[k];i++){
            if(a[k] % i == 0){
                divs[k].push_back(i);
                s[i].insert({a[k], k});
                if(i*i != a[k]){
                    divs[k].push_back(a[k]/i);
                    s[a[k]/i].insert({a[k], k});
                }
            }
        }
    }
    int id = 0;
    for(int i=0;i<n-1;i++){
        ll min_t = -1;
        cout<<a[id]<<' ';
        int next_id = id;
        for(int j = 0;j < divs[id].size(); j++){
            int div = divs[id][j];
            s[div].erase({a[id], id});
            if(s[div].empty())continue;
            int a_index = s[div].begin()->first;
            int index = s[div].begin()->second;

//            cout<<i<<':'<<j<<':'<<div<<':'<<a_index<<':'<<index<<endl;

            ll lcm_res = lcm(a[id], a_index);
            if(min_t == -1ll || min_t > lcm_res || (min_t == lcm_res && a_index < a[next_id])){
                min_t = lcm_res;
                next_id = index;
            }
        }
//        printf("next_id = %d\n", next_id);
        id = next_id;
    }
    cout<<a[id]<<endl;
    return 0;
}