#include<cstdio>
#include<vector>
#include<algorithm>


using namespace std;


int gcd(int a, int b)
{
	int c;
	while((c=a%b))
	{
		a=b;
		b=c;
	}
	return b;
}


int lcm(int a, int b)
{
	return a/gcd(a,b)*b;
}


int main(void)
{
	int n, i, j, x;
	int min_lcm, min_idx;
	vector<int> a;

	while(scanf("%d", &n)==1)
	{
		a.resize(n);
		for(i=0;i<n;i++)
		{
			scanf("%d", &a[i]);
		}

		for(i=0;i+2<n;i++)
		{
			min_lcm=lcm(a[i], a[i+1]);
			min_idx=i+1;
			for(j=i+2;j<n;j++)
			{
				x=lcm(a[i], a[j]);
				if(min_lcm>x)
				{
					min_lcm=x;
					min_idx=j;
				}
				else if(min_lcm==x && a[min_idx]>a[j])
				{
					min_idx=j;
				}
			}
			swap(a[i+1], a[min_idx]);
		}

		for(i=0;i<n-1;i++)
		{
			printf("%d ", a[i]);
		}
		printf("%d\n", a[i]);
	}

	return 0;
}