#include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; #define REP(i,a,n) for(int i=(a); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() typedef long long ll; int gcd(int a, int b){return (b==0?a:gcd(b,a%b));} int lcm(int a, int b){return a/gcd(a,b)*b;} struct ST { int a, b; }; bool operator<(const ST& a, const ST& b){ if(a.b==b.b) return a.a ret; vector A; cin >> N; rep(i,N){ cin >> a; A.push_back((ST){a,a}); } ret.push_back(A[0].a); int prev = A[0].a; A[0].a = -1; rep(i,N){ int tmp_a = 100000000; int tmp_b = 100000000; int tmp_i = -1; rep(j,N){ if(A[j].a == -1) continue; A[j].b = lcm(prev, A[j].a); if(tmp_b == A[j].b && tmp_a > A[j].a){ tmp_a = A[j].a; tmp_i = j; }else if(tmp_b > A[j].b){ tmp_b = A[j].b; tmp_a = A[j].a; tmp_i = j; } } if(tmp_i >= 0){ ret.push_back(tmp_a); prev = tmp_a; A[tmp_i].a = -1; } } rep(i,ret.size()){ if(i!=0) cout << " "; cout << ret[i]; } cout << endl; return 0; }