//とりあえず愚直な解法を投げてみる

#include <stdio.h>

int gcd(int, int);
int lcm(int, int);

int n, a[10000];

int main(void) {
	scanf("%d", &n);
	int i, j;
	for(i = 0; i < n; i++) {
		scanf("%d", &a[i]);
	}
	
	printf("%d ", a[0]);
	for(i = 0; i < n - 1; i++) {
		int min = 100000000, p = -1;
		for(j = i + 1; j < n; j++) {
			int l = lcm(a[i], a[j]);
			if( l < min || (l == min && a[j] < a[p]) ) {
				min = l;
				p = j;
			}
		}
		int temp = a[i + 1];
		a[i + 1] = a[p];
		a[p] = temp;
		printf("%d ", a[i + 1]);
	}
	printf("\n");
	
	return 0;
}

int gcd(int x, int y) {
	int max = (y < x) ? x : y;
	int min = (x < y) ? x : y;
	if(min == 0) { return max; }
	return gcd(min, max % min);
}

int lcm(int x, int y) {
	return x * y / gcd(x, y);
}