/* -*- coding: utf-8 -*-
 *
 * 14.cc: No.14 最小公倍数ソート - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 10000;
const int MAX_A = 10000;

const int INF = 1 << 30;

/* typedef */

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef set<pii> spii;

/* global variables */

pii ais[MAX_N];
vi dvs[MAX_N];
spii dais[MAX_A + 1];

/* subroutines */

inline int lcm(int a, int b) { return a * b / __gcd(a, b); }

/* main */

int main() {
  int n;
  cin >> n;

  for (int i = 0; i < n; i++)
    (cin >> ais[i].first), ais[i].second = i;

  for (int i = 0; i < n; i++) {
    int &ai = ais[i].first;
    for (int d = 1; d * d <= ai; d++)
      if (ai % d == 0) {
	dvs[i].push_back(d), dais[d].insert(ais[i]);
	int d1 = ai / d;
	if (d1 != d)
	  dvs[i].push_back(d1), dais[d1].insert(ais[i]);
      }

    //for (int j = 0; j < dvs[i].size(); j++) printf("%d ", dvs[i][j]);
    //putchar('\n');
  }

  vi ans;
  pii fai(ais[0]);

  for (int i = 0; i < n; i++) {
    //printf("fai=(%d,%d)\n", fai.first, fai.second);
    int mincm = INF;
    pii minai;

    ans.push_back(fai.first);
    vi &dvf = dvs[fai.second];
    for (int j = 0; j < dvf.size(); j++) {
      int dj = dvf[j];
      dais[dj].erase(fai);

      if (dais[dj].size() > 0) {
	pii top = *(dais[dj].begin());
	int cm = top.first / dj;
	//printf("dj=%d: cm=%d, top=(%d,%d)\n", dj, cm, top.first, top.second);
	if (mincm > cm || (mincm == cm && minai > top))
	  mincm = cm, minai = top;
      }
    }

    fai = minai;
    //printf("fai=(%d,%d)\n", fai.first, fai.second);
    //exit(0);
  }

  for (int i = 0; i < n; i++) {
    if (i) putchar(' ');
    printf("%d", ans[i]);
  }
  putchar('\n');

  return 0;
}