#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

using namespace std;

inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
typedef unsigned long long ULL;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(auto i: c)
#define SORT(c) sort((c).begin(),(c).end())

const double EPS = 1e-10;
const double PI  = acos(-1.0);

#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N;
	cin >> N;
	VI a(N);
	REP(i, N) cin >> a[i];
	sort(a.begin() + 1, a.end());

	VI prime;
	vector<bool> isPrime(101, true);
	isPrime[0] = isPrime[1] = false;
	REP(i, 100){
		if(isPrime[i]){
			prime.push_back(i);
			for(int j = i; j < 100; j++) isPrime[j] = false;
		}
	}

	VVI div(N, VI(prime.size(), 0));
	VI b = a;
	REP(i, N){
		REP(j, prime.size()){
			while(b[i] % prime[j] == 0){
				div[i][j]++;
				b[i] /= prime[j];
			}
			if(b[i] == 1) break;
		}
	}

	vector<bool> done(N, false);
	int pre = 0, index;
	REP(i, N){
		int m = 10001;
		REP(j, N){
			if(done[j]) continue;
			int tmp = 1;
			REP(k, prime.size()){
				int cnt = max(div[pre][k], div[j][k]);
				while(cnt > 0){
					tmp *= prime[k];
					cnt--;
				}
			}
			if(tmp < m){
				m = tmp;
				index = j;
			}
		}
		cout << a[index] << " ";
		pre = index;
		done[pre] = true;
	}
	cout << endl;

	return 0;
}