////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
#include <type_traits>
#include <mutex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

//// i/o helper ////

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; v.reserve(n); REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; v.reserve(n); REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, pair<T1, T2> &p) { out << p.first << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, const vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1);
	return out;
}

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << '\n'

void solve();
int main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(false);
	solve();
	return 0;
}


// 約数
inline vector<int> allDivisor(int n)
{
	vector<int> r;
	for (int i = 1; i * i <= n; i++)
	{
		if (n % i == 0) { r.push_back(i); }
	}
	int rsz = r.size() - (r.back() * r.back() == n);
	RREP(i, rsz) { r.push_back(n / r[i]); }

	return r;
}

////////////////////
/// template end ///
////////////////////

void solve()
{
	READ(int, N);
	auto A = read<int>(N);

	// 約数マップ
	map<int, vector<int>> divisors;
	for (auto a : A)
	{
		if (!divisors.count(a))
		{
			divisors[a] = allDivisor(a);
		}
	}

	// 約数別キュー
	map<int, set<pair<int, int>>> queues;
	REP(i, N)
	{
		int a = A[i];
		for (auto d : divisors.at(a))
		{
			queues[d].emplace(a / d, i);
		}
	}

	vector<int> R;

	auto select = [&](int index)
	{
		int a = A[index];
		R.push_back(a);
		for (auto d : divisors.at(a))
		{
			queues[d].erase(pair<int, int>(a / d, index));
		}
	};

	select(0);

	REP (i, N - 1)
	{
		int minLcm = INF;
		int minSrc = INF;
		int foundIndex = INF;

		int cur = R[i];
		for (int gcd : divisors.at(cur))
		{
			auto &q = queues.at(gcd);
			if (!q.empty())
			{
				auto cand = *q.begin();
				int lcm = cand.first * A[i];
				int index = cand.second;

				if (lcm < minLcm || (lcm == minLcm && A[index] < minSrc))
				{
					minLcm = lcm;
					minSrc = A[index];
					foundIndex = index;
				}
			}
		}

		select(foundIndex);
	}
	WRITE(R);
}