#include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
#include<ctime>
#include<set>
using namespace std;


#define li			long long int
#define rep(i,to)	for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)	for(li i=(li)(start);i<((li)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define F first
#define S second
#define endl "\n"
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl

inline li gcd(li a, li b){
	if(a<b)swap(a,b);
	if(a%b==0)return b;
	return gcd(b, a%b);
}

inline li lcm(li a, li b){
	li g=gcd(a,b);
	return a*b/g;
}

li a[10010];
pair<li,li> aa[10010];

int main(){
	ios::sync_with_stdio(false);
	li n;
	cin>>n;
	rin{cin>>a[i];}
	rin{
		repp(j,i+1, n)aa[j-i-1]=mp(lcm(a[i], a[j]), a[j]);
		sort(aa, aa+n-i-1);
		repp(j,i+1, n)a[j]=aa[j-i-1].S;
	}
	rin{cout<<a[i]<<" ";}
	puts("");


	return 0;
}