#define _USE_MATH_DEFINES
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iostream>
#include <cfloat>
#include <climits>
#include <cstring>
#include <cmath>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<int, ll> i_ll;
typedef pair<ll, int> ll_i;
typedef pair<double, int> d_i;
typedef pair<ll, ll> ll_ll;
typedef pair<double, double> d_d;
struct edge { int u, v; ll w; };

ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;

int gcd(int a, int b) {
	if (b == 0) return abs(a);
	else return gcd(b, a % b);
}

int main() {
	int N; cin >> N;
	vector<int> a(N);
	for (int i = 0; i < N; i++)
		cin >> a[i];
	for (int i = 0; i + 1 < N; i++) {
		int _j = i + 1;
		for (int j = i + 1; j < N; j++) {
			int d = gcd(a[i], a[j]), x = a[j] / d;
			int _d = gcd(a[i], a[_j]), _x = a[_j] / _d;
			if (x < _x || (x == _x && a[j] < a[_j]))
				_j = j;
		}
		swap(a[i + 1], a[_j]);
	}
	for (int i = 0; i < N; i++)
		cout << a[i] << (i + 1 < N ? ' ' : '\n');
}