#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
inline ll lcm(ll a, ll b) { return a*b/__gcd(a,b); }

int main() {
  int N; cin >> N;
  int a[N], res[N];
  for(int i=0;i<N;i++) scanf("%d", a+i);
  res[0] = a[0];
  int rcnt = 1;
  for(int i=0;i<N-1;i++) {
    ll mn = 1<<29;
    for(int j=i+1;j<N;j++) {
      mn = min(mn, lcm(res[i], a[j]));
    }
    int idx, raw = 1<<29;
    for(int j=i+1;j<N;j++) {
      if(mn == lcm(res[i], a[j])) {
        if(a[j] < raw) { raw = a[j]; idx = j; }
      }
    }
    swap(a[i+1], a[idx]);
    res[rcnt++] = raw;
  }
  
  for(int i=0;i<N;i++) {
    if(i) printf(" ");
    printf("%d", res[i]);
  }
  puts("");
  
  return 0;
}