// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e9 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

set<P> st[10001];
template<typename T>
T gcd(T a, T b) {
  if(a > b)return gcd(b, a);
  if(a == 0)return b;
  return gcd(b % a, a);
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  rep(i, n){
    cin >> a[i];
    if(i == 0)continue;
    for(int j = 1; j * j <= a[i]; j++){
      if(a[i] % j == 0){
        st[j].insert(mk(a[i], i));
        if(j * j != a[i])st[a[i]/j].insert(mk(a[i], i));
      }
    }
  }
  vector<P> res;
  res.pb(mk(a[0], 0));
  for(int i = 0; i < n - 1; i++){
    int A = res[sz(res)-1].first;
    ll mini = inf;
    P tmp;
    for(int j = 1; j * j <= A; j++){
      if(A % j == 0){
        if(st[j].size()){
          auto p = *st[j].begin();
          ll val = (ll)p.first * A / gcd(A, p.first);
          if(val < mini){
            mini = val;
            tmp = p;
          }else if(val == mini && tmp.first > p.first){
            tmp = p;
          }
        }
        if(st[A/j].size()){
          auto p = *st[A/j].begin();
          ll val = (ll)p.first * A / gcd(A, p.first);
          if(val < mini){
            mini = val;
            tmp = p;
          }else if(val == mini && tmp.first > p.first){
            tmp = p;
          }
        }
      }
    }
    res.pb(mk(a[tmp.second], tmp.second));
    for(int j = 1; j * j <= a[tmp.second]; j++){
      if(a[tmp.second] % j == 0){
        st[j].erase(mk(a[tmp.second], tmp.second));
        if(j * j != a[tmp.second]){
          st[a[tmp.second]/j].erase(mk(a[tmp.second], tmp.second));
        }
      }
    }
  }
  rep(i, n)cout << res[i].first << "\n "[i + 1 != n];
	return 0;
}