/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author majk
 */

#ifndef MAJK_LIB
#define MAJK_LIB

#include <vector>
#include <stack>
#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <iomanip>
#include <set>
#include <functional>
#include <algorithm>
#include <numeric>
#include <cassert>
#include <cmath>
#include <string>
#include <queue>
#include <array>
#include <bitset>
using namespace std;

#define x first
#define y second
typedef std::pair<int,int> pii; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair<ui,ui> puu;

template <typename T, typename U> std::istream&operator>>(std::istream&i, pair<T,U>&p) {i >> p.x >> p.y; return i;}
template<typename T>std::istream&operator>>(std::istream&i,vector<T>&t) {for(auto&v:t){i>>v;}return i;}
template <typename T, typename U> std::ostream&operator<<(std::ostream&o, const pair<T,U>&p) {o << p.x << ' ' << p.y; return o;}
template<typename T>std::ostream&operator<<(std::ostream&o,const vector<T>&t) {if(t.empty())o<<'\n';for(size_t i=0;i<t.size();++i){o<<t[i]<<" \n"[i == t.size()-1];}return o;}
template<typename T> using minheap = priority_queue<T, vector<T>, greater<T>>;
template<typename T> using maxheap = priority_queue<T, vector<T>, less<T>>;
ui logceil(ll x) { return x?8*sizeof(ll)-__builtin_clzll(x):0; }

namespace std { template<typename T,typename U>struct hash<pair<T,U>>{hash<T>t;hash<U>u;size_t operator()(const pair<T,U>&p)const{return t(p.x)^(u(p.y)<<7);}}; }
template<typename T,typename F>T bsh(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){l=m+1;r=m;}else{h=m-1;}}return r;}
template<typename F> double bshd(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){l=m;}else{h=m;}}return (l+h)/2;}
template<typename T,typename F>T bsl(T l,T h,const F&f){T r=-1,m;while(l<=h){m=(l+h)/2;if(f(m)){h=m-1;r=m;}else{l=m+1;}}return r;}
template<typename F> double bsld(double l,double h,const F&f,double p=1e-9){ui r=3+(ui)log2((h-l)/p);while(r--){double m=(l+h)/2;if(f(m)){h=m;}else{l=m;}}return (l+h)/2;}
template<typename T> T gcd(T a,T b) { if (a<b) swap(a,b); return b?gcd(b,a%b):a; }


template<typename T>class vector2:public vector<vector<T>>{public:vector2(){} vector2(size_t a,size_t b,T t=T()):vector<vector<T>>(a,vector<T>(b,t)){}};
template<typename T>class vector3:public vector<vector2<T>>{public:vector3(){} vector3(size_t a,size_t b,size_t c,T t=T()):vector<vector2<T>>(a,vector2<T>(b,c,t)){}};
template<typename T>class vector4:public vector<vector3<T>>{public:vector4(){} vector4(size_t a,size_t b,size_t c,size_t d,T t=T()):vector<vector3<T>>(a,vector3<T>(b,c,d,t)){}};
template<typename T>class vector5:public vector<vector4<T>>{public:vector5(){} vector5(size_t a,size_t b,size_t c,size_t d,size_t e,T t=T()):vector<vector4<T>>(a,vector4<T>(b,c,d,e,t)){}};


#endif

class ERearranging {
public:
    int N, M, P;
    vector<vector<int>> Multiples;
    vector<vector<int>> Factors;
//    map<int, int> C;
    vector<int> B;
    vector<int> Stack;
    vector<bool> Forbidden;
    vector<int> CompVisit, PrimeVisit;
    int CompTime;

    vector<int> component(int value) {
        ++CompTime;
        CompVisit[value] = CompTime;
        vector<int> Q{value};
        for (int q = 0; q < Q.size(); ++q) {
            int v = Q[q];
            for (int f: Factors[v]) {
                if (PrimeVisit[f] == CompTime) continue;
                PrimeVisit[f] = CompTime;
                for (int m: Multiples[f]) {
                    if (Forbidden[m]) continue;
                    if (CompVisit[m] == CompTime) continue;
                    CompVisit[m] = CompTime;
                    Q.push_back(m);
                }
            }
        }
        sort(Q.begin(),Q.end());
        return Q;
    }

    vector<int> solve(const vector<int> &Component) {
        vector<vector<int>> Others;
        vector<bool> Used(N, false);

        for (int val: Component) {
            if (!Used[val]) {
                auto cc = component(val);
                for (int c: cc) Used[c] = true;

                int root = -1;
                for (int c: cc) {
                    bool ok = Stack.empty() || gcd(B[Stack.back()], B[c]) != 1;
//true;
//                    for (int i = (int) Stack.size() - 1; i >= 0; --i) {
//                        if (gcd(B[Stack[i]], B[c]) != 1) break;
//                        else if (B[Stack[i]] < B[c]) {
//                            ok = false;
//                            break;
//                        }
//                    }
                    if (ok) {
                        root = c;
                        break;
                    }
                }

                Stack.push_back(root);
                Forbidden[root] = true;
                cc.erase(find(cc.begin(),cc.end(),root));
                vector<int> Z = solve(cc);
                Stack.pop_back();
                Forbidden[root] = false;

                Others.push_back({B[root]});
                for (int z: Z) Others.back().push_back(z);
            }
        }

        vector<int> Answer;
        if (!Others.empty()) {
            vector<int> Merged = Others[0];
            for (int i = 1; i < Others.size(); ++i) {
                vector<int> QQ;
                int j = 0, k = 0;
                while (j < Merged.size() || k < Others[i].size()) {
                    if (j == Merged.size()) { QQ.push_back(Others[i][k++]); }
                    else if (k == Others[i].size()) { QQ.push_back(Merged[j++]); }
                    else if (Merged[j] < Others[i][k]) { QQ.push_back(Others[i][k++]); }
                    else { QQ.push_back(Merged[j++]); }
                }
                swap(Merged, QQ);
            }
            for (int m: Merged) Answer.push_back(m);
        }
        return Answer;
    }


    void solve(istream& cin, ostream& cout) {
        cin >> N;
        vector<int> A(N); cin >> A;
        sort(A.begin(),A.end());
        B = A;

        vector<int> Ans;
        if (!B.empty()) {
            Forbidden.assign(N, false);

            CompTime = 0;
            CompVisit.assign(N, 0);

            vector<int> AllPrimes;
            for (int b: B) {
                int x = b;
                for (int p = 2; p <= 10000; ++p) {
                    if (x%p == 0) {
                        AllPrimes.push_back(p);
                        while (x%p == 0) x /= p;
                    }
                }
                if (x != 1) {
                    AllPrimes.push_back(x);
                }
            }
            map<int, int> CompressPrimes;
            P = 0;
            sort(AllPrimes.begin(),AllPrimes.end());
            AllPrimes.resize(distance(AllPrimes.begin(),unique(AllPrimes.begin(),AllPrimes.end())));
            for (int p: AllPrimes) CompressPrimes[p] = P++;
            Multiples.resize(P);
            PrimeVisit.assign(P, 0);

            for (int j = 0; j < N; ++j) {
                int x = B[j];
                Factors.push_back({});
                for (int p = 2; p <= 10000; ++p) {
                    if (x%p == 0) {
                        Factors.back().push_back(CompressPrimes[p]);
                        while (x%p == 0) x /= p;
                        Multiples[CompressPrimes[p]].push_back(j);
                    }
                }
                if (x != 1) {
                    Factors.back().push_back(CompressPrimes[x]);
                    Multiples[CompressPrimes[x]].push_back(j);
                }
            }

            vector<int> All;
            for (int i = 0; i < N; ++i) All.push_back(i);
            auto res = solve(All);
            for (int r: res) Ans.push_back(r);
        }
//        for (int i = 0; i < C[1]; ++i) Ans.push_back(1);
        cout << Ans;
    }
};


int main() {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
	ERearranging solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
    return 0;
}


Measured memory_bytes: 12288