#include<bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)n;i++)
#define all(c) (c).begin(),(c).end()
#define mp make_pair
#define pb push_back
#define each(i,c) for(__typeof((c).begin()) i=(c).begin();i!=(c).end();i++)
#define dbg(x) cerr<<__LINE__<<": "<<#x<<" = "<<(x)<<endl

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef pair<int,int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;

int n, a[10000];
vector<vector<short>> g;

int main(){
	g.resize(10001);
	for(int i = 1; i <= 10000; i++){
		g[i].resize(i + 1);
		for(int j = 1; j < i; j++) g[i][j] = g[max(i - j, j)][min(i - j, j)];
		g[i][i] = i;
	}
	
	cin >> n;
	rep(i, n) cin >> a[i];
	rep(i, n){
		vector<pi> v;
		for(int j = i + 1; j < n; j++) v.pb(pi(a[i] / g[max(a[i], a[j])][min(a[i], a[j])] * a[j], a[j]));
		#if 0
		rep(j, v.size()) cerr<<v[j].first<<(j==v.size()-1?"\n":" ");
		rep(j, v.size()) cerr<<v[j].second<<(j==v.size()-1?"\n":" ");
		cerr<<endl;
		#endif
		sort(all(v));
		rep(j, v.size()) a[i + j + 1] = v[j].second;
	}
	
	rep(i, n) printf("%d%c", a[i], i == n - 1 ? '\n' : ' ');
	
	return 0;
}