#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)
template<typename T> istream& operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream& operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream& operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream& operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream& operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream& operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> void Max(T &m, const T q) { if (m < q) m = q; }
template<typename T> void Min(T &m, const T q) { if (m > q) m = q; }
template<typename T1, typename T2> pair<T1, T2> operator+(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(pair<T1, T2> &l, pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;

int N;
vector<lint> A;
vector<bool> used;
vector<vector<int>> to;

vector<int> merge_vec(const vector<vector<int>> &input)
{
    int m = input.size();
    vector<int> ans;
    int n = 0;
    for (auto vec : input) n += vec.size();

    vector<int> pos(m);
    REP(_, n)
    {
        vector<int> vals(m);
        REP(i, m) if (pos[i] < input[i].size()) vals[i] = A[input[i][pos[i]]];
        int winner = distance(vals.begin(), max_element(vals.begin(), vals.end()));
        ans.push_back(input[winner][pos[winner]]);
        pos[winner]++;
    }
    return ans;
}

vector<int> dfs(int now)
{
    used[now] = true;
    vector<vector<int>> tmp;
    for (auto nxt : to[now]) if (!used[nxt]) tmp.push_back(dfs(nxt));
    vector<int> ans = merge_vec(tmp);
    ans.insert(ans.begin(), now);
    return ans;
}

int main()
{
    cin >> N;
    A.resize(N);
    cin >> A;
    sort(A.begin(), A.end());

    to.resize(N);
    REP(i, N) REP(j, i) if (__gcd(A[i], A[j]) != 1)
    {
        to[i].push_back(j);
        to[j].push_back(i);
    }

    used.assign(N, false);
    vector<vector<int>> ans;
    REP(i, N) if (!used[i]) ans.push_back(dfs(i));
    vector<int> res = merge_vec(ans);
    REP(i, N - 1) printf("%lld ", A[res[i]]);
    printf("%lld\n", A[res.back()]);
}


Measured memory_bytes: 16896