#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vb  = vector<bool>;
using vvi = vector<vi>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll  INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;

template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    vb isPrime(10001, true);
    isPrime[0] = isPrime[1] = false;
    for(int i = 2; i <= 10000; i++)
    {
        if(isPrime[i])
        {
            for(int j = i * 2; j <= 10000; j += i) isPrime[j] = false;
        }
    }

    vl prime;
    REP(i, 100001) if(isPrime[i]) prime.pb(i);

    ll N; cin >> N;
    vl a(N); REP(i, N) cin >> a[i];
    vector<pl> b(N-1);
    REP(i, N-1)
    {
        ll tmp = 1;
        REP(j, (int)prime.size()) if(a[i+1] % prime[j] == 0) tmp *= prime[j];
        b[i].first = tmp;
        b[i].second = a[i+1];
    }
    sort(ALL(b));
    cout << a[0];
    REP(i, (int)b.size()) cout << " " << b[i].second;
    cout << endl;
}