#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint=modint1000000007;
signed main(){
  ll N;cin>>N;vector<ll>A(N);vector<vector<ll>>D(N,vector<ll>());
  REP(i,N)cin>>A[i];sort(A.begin()+1,A.end());
  REP(i,N){
    ll d=1;while(d*d<A[i]){if(A[i]%d==0){D[i].push_back(d);D[i].push_back(A[i]/d);}d++;}
    if(d*d==A[i])D[i].push_back(d);sort(ALL(D[i]));
  }
  vector<ll>d,dd;REP(i,N)REP(j,D[i].size())d.push_back(D[i][j]);sort(ALL(d));
  REP(i,d.size())if(i==0||d[i]!=d[i-1])dd.push_back(d[i]);
  REP(i,N)REP(j,D[i].size())D[i][j]=LB(dd,D[i][j]);
  vector<vector<ll>>Q(dd.size(),vector<ll>());
  REP(i,N)REP(j,D[i].size())Q[D[i][j]].push_back(i);
  vector<bool>X(N,1);X[0]=0;ll p=0;cout<<A[p];
  REP(i,N-1){
    ll pp,m=1e18;
    REP(j,D[p].size()){
      ll k=0;while(k<Q[D[p][j]].size()&&!X[Q[D[p][j]][k]])k++;
      if(k<Q[D[p][j]].size()&&m>A[Q[D[p][j]][k]]/dd[D[p][j]]){
        m=A[Q[D[p][j]][k]]/dd[D[p][j]];pp=Q[D[p][j]][k];
      }
    }
    p=pp;X[pp]=0;
    cout<<" "<<A[p];
  }
  cout<<endl;
  return 0;
}