#include <stdio.h>
#include <math.h>
#include <limits.h>
#include <stdlib.h>

typedef long long ll;
#define MAX_N 112233
#define REP(i, x, n) for(i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define INF 0x7FFFFFFF
#define ALLOCA(type, n) ((type*)alloca(sizeof(type) * (n)))
#define MALLOC(type, n) ((type*)malloc(sizeof(type) * (n)))
#define CALLOC(type, n) ((type*)calloc((n), sizeof(type)))
#define REALLOC(type, n, p) ((type*)realloc((p), sizeof(type) * (n)))

typedef struct heap_queue{long *data;long size;}hq;
void heappush(hq *q,int data){long i = q->size;q->size++;while(i > 0){long p = (i - 1) / 2;if (q->data[p]<=data){break;}q->data[i] = q->data[p];i=p;}q->data[i] = data;}
long heappop(hq *q){long ret = q->data[0];q->size--;long data = q->data[q->size];long i = 0;while(i * 2 + 1 < q->size) {long a = i * 2 + 1, b = i * 2 + 2;if (b < q->size && q->data[b] < q->data[a]) {a=b;}if (q->data[a] >= data) {break;}q->data[i] = q->data[a];i=a;}q->data[i]=data;return ret;}

#define SORT(h, n) qsort(h, n, sizeof(h[0]), ASC)
#define RSORT(h, n) qsort(h, n, sizeof(h[0]), DESC)
int ASC(const void *c1,const void *c2){int tmp1=*(int *)c1;int tmp2=*(int *)c2;if(tmp1<tmp2){return -1;}if(tmp1==tmp2){return 0;}if(tmp1>tmp2){return 1;}}
int DESC(const void *c1,const void *c2){int tmp1 = *(int *)c1;int tmp2=*(int *)c2;if(tmp1>tmp2){return -1;}if(tmp1==tmp2){return  0;}if(tmp1<tmp2){return 1;}}

int Gcd(int m, int n){return (n <= 0) ? m:Gcd(n, m % n);}
int Bcd(int m, int n){return m * n / Gcd(m, n);}

int main(void)
{
  int i,j,k;
  int *b;
  int *ans;
  int n;
  int index = 0;
  int data[3] = {INF,INF,INF};
  int tmp = 0;
  scanf("%d", &n);
  b = MALLOC(int, n + 1);
  ans = CALLOC(int, n + 1);
  rep(i, n) scanf("%d", &b[i]);
  ans[0] = b[0];
  while(n > index) {
    data[0] = INF;
    data[1] = INF;
    data[2] = INF;
    REP(j, 1, n) {
      if(b[j] != 0) {
        tmp = Bcd(ans[index], b[j]);
        if (tmp == data[2]) {
          if (b[j] < data[0]) {
            data[0] = b[j];
            data[1] = j;
            data[2] = tmp;
          }
        }
        else {
          if(tmp < data[2]) {
            data[0] = b[j];
            data[1] = j;
            data[2] = tmp;
          }
        }
      }
    }
    index++;
    if (n <= index) break;
    ans[index] = data[0];
    b[data[1]] = 0;
  }
  rep(k, n) printf("%d ", ans[k]);
  puts("\n");
  free(b);
  free(ans);
  return 0;
}