// includes #include // macros #define pb emplace_back #define mk make_pair #define pq priority_queue #define FOR(i, a, b) for(int i=(a);i<(b);++i) #define rep(i, n) FOR(i, 0, n) #define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--) #define irep(itr, st) for(auto itr = (st).begin(); itr != (st).end(); ++itr) #define irrep(itr, st) for(auto itr = (st).rbegin(); itr != (st).rend(); ++itr) #define vrep(v, i) for(int i = 0; i < (v).size(); i++) #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end()) #define FI first #define SE second #define bit(n) (1LL<<(n)) #define INT(n) int n; cin >> n; #define LL(n) ll n; cin >> n; #define DOUBLE(n) double n; cin >> n; using namespace std; template bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;} template bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;} template istream &operator>>(istream &is, vector &vec){for(auto &v: vec)is >> v; return is;} template ostream &operator<<(ostream &os, const vector& vec){for(int i = 0; i < vec.size(); i++){ os << vec[i]; if(i + 1 != vec.size())os << " ";} return os;} template ostream &operator<<(ostream &os, const set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_set& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const unordered_multiset& st){for(auto itr = st.begin(); itr != st.end(); ++itr){ os << *itr; auto titr = itr; if(++titr != st.end())os << " ";} return os;} template ostream &operator<<(ostream &os, const pair &p){os << p.first << " " << p.second; return os;} template ostream &operator<<(ostream &os, const map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} template ostream &operator<<(ostream &os, const unordered_map &mp){for(auto itr = mp.begin(); itr != mp.end(); ++itr){ os << itr->first << ":" << itr->second; auto titr = itr; if(++titr != mp.end())os << " "; } return os;} // types using ll = long long int; using P = pair; using Pli = pair; using Pil = pair; using Pll = pair; using Pdd = pair; using cd = complex; // constants const int inf = 1e9; const ll linf = 1LL << 50; const double EPS = 1e-10; const int mod = 1e9 + 7; const int dx[4] = {-1, 0, 1, 0}; const int dy[4] = {0, -1, 0, 1}; // solve set

st[10001]; int main(int argc, char const* argv[]) { ios_base::sync_with_stdio(false); cin.tie(0); cout << fixed << setprecision(20); INT(n); vector a(n); cin >> a; FOR(i, 1, n){ for(int j = 1; j * j <= a[i]; j++){ if(a[i] % j == 0){ st[j].insert(mk(a[i], i)); st[a[i]/j].insert(mk(a[i], i)); } } } vector res; int next = a[0]; rep(i_, n){ res.pb(next); if(i_ + 1 == n)break; int maxi = inf; int at = -1; for(int j = 1; j * j <= next; j++){ if(next % j == 0){ if(sz(st[j])){ int tmp = (*st[j].begin()).FI / j; if(tmp < maxi){ maxi = tmp; at = (*st[j].begin()).SE; }else if(tmp == maxi){ if(at == -1 || a[at] > (*st[j].begin()).FI){ at = (*st[j].begin()).SE; } } } if(sz(st[next/j])){ int tmp = (*st[next/j].begin()).FI / (next / j); if(tmp < maxi){ maxi = tmp; at = (*st[next/j].begin()).SE; }else if(tmp == maxi){ if(at == -1 || a[at] > (*st[next/j].begin()).FI){ at = (*st[next/j].begin()).SE; } } } } } next = a[at]; for(int j = 1; j * j <= next; j++){ if(next % j == 0){ st[j].erase(mk(a[at], at)); st[a[at]/j].erase(mk(a[at], at)); } } } cout << res << endl; return 0; }