import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[N];
      foreach (i; 0 .. N) {
        A[i] = readInt();
      }
      A[1 .. N].sort;
      
      auto dss = new int[][N];
      foreach (i; 0 .. N) {
        for (int d = 1; d^^2 <= A[i]; ++d) {
          if (A[i] % d == 0) {
            dss[i] ~= d;
            if (d != A[i] / d) {
              dss[i] ~= A[i] / d;
            }
          }
        }
        dss[i].sort;
      }
      
      const lim = A.maxElement + 1;
      auto iss = new DList!int[lim];
      foreach (i; 1 .. N) {
        foreach (d; dss[i]) {
          iss[d] ~= i;
        }
      }
      
      auto ans = new int[N];
      auto used = new bool[N];
      ans[0] = 0;
      used[0] = true;
      foreach (j; 1 .. N) {
        auto mn = tuple(int.max, int.max);
        foreach (d; dss[ans[j - 1]]) {
          for (; !iss[d].empty; ) {
            int i = iss[d].front;
            if (used[i]) {
              iss[d].removeFront;
            } else {
              chmin(mn, tuple(A[i] / d, i));
              break;
            }
          }
        }
        ans[j] = mn[1];
        used[mn[1]] = true;
      }
      
      foreach (j; 0 .. N) {
        if (j > 0) write(" ");
        write(A[ans[j]]);
      }
      writeln();
    }
  } catch (EOFException e) {
  }
}