#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef unsigned int ui; const ll mod = 1000000007; const ll INF = (ll)1000000007 * 1000000007; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=sta;i--) #define rep1(i,n) for(int i=1;i<=n;i++) #define per1(i,n) for(int i=n;i>=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef long double ld; typedef complex Point; const ld eps = 1e-8; const ld pi = acos(-1.0); typedef pair LP; int n,a[10010]; multiset di[10010]; template vector divisor_list(T x){ vector res; for(T i=1;i*i<=x;i++){ if (x%i==0) { res.push_back(i); if (i*i!=x) res.push_back(x/i); } } return res; } void solve(){ cin >> n; rep(i,n){ cin >> a[i]; } rep(i,10010){ di[i].insert(mod); } Rep(i,1,n){ vector D=divisor_list(a[i]); for(auto d:D){ di[d].insert(a[i]); } } vector ans={a[0]}; rep(i,n-1){ vector D=divisor_list(ans[i]); int num=mod,k=-1; for(auto d:D){ int m=*di[d].begin(); //cout << m << endl; if (num>m/d || (num==m/d && k>m)) { num=m/d; k=m; } } ans.push_back(k); vector D_=divisor_list(k); for(auto d:D_){ di[d].erase(di[d].find(k)); } } for(auto x:ans){ cout << x << " "; } } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(50); solve(); }