#include <bits/stdc++.h>
using namespace std;
const double PI = 2 * acos(0.0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng_64(chrono::steady_clock::now().time_since_epoch().count());
const string DIGITS = "0123456789";
const string ALPH = "abcdefghijklmnopqrstuvwxyz";
template <class T0, class T1>
inline ostream &operator<<(ostream &out, pair<T0, T1> &a) {
  return out << "{" << a.first << ", " << a.second << "}";
}
template <class T0, class T1>
inline istream &operator>>(istream &in, pair<T0, T1> &a) {
  return in >> a.first >> a.second;
}
template <class T0, class T1, class T2>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << "}";
}
template <class T0, class T1, class T2, class T3>
inline ostream &operator<<(ostream &out, tuple<T0, T1, T2, T3> &a) {
  return out << "{" << get<0>(a) << ", " << get<1>(a) << ", " << get<2>(a)
             << ", " << get<3>(a) << "}";
}
template <class T>
inline ostream &operator<<(ostream &out, vector<T> &a) {
  out << "[";
  for (long long i = 0; i < long long(a.size()); ++i)
    out << a[i] << vector<string>{", ", "]  "}[i + 1 == a.size()];
  return out;
}
void smain();
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << setprecision(12) << fixed;
  smain();
  return 0;
}
const long long MOD = 1e9 + 7, N = 410, M = 18, oo = 1e9;
void smain() {
  long long t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    vector<long long> a(n);
    vector<long long> p(1001);
    for (long long i = 0; i < n; i++) {
      cin >> a[i];
      for (long long j = 1; j <= 1000; j++) {
        if (a[i] % j == 0) {
          p[j]++;
        }
      }
    }
    vector<long long> c;
    for (long long i = n; i >= 1; i--) {
      long long k;
      for (long long j = 1; j <= 1000; j++) {
        if (p[j] >= i) k = j;
      }
      c.push_back(k);
    }
    vector<long long> b;
    vector<bool> used(n);
    reverse(c.begin(), c.end());
    for (long long i = n - 2; i >= 0; i--) {
      if (c[i] != c[i + 1]) {
        for (long long j = 0; j < n; j++) {
          if (!used[j] && a[j] % c[i + 1] == 0 && a[j] % c[i] != 0) {
            used[j] = true;
            b.push_back(a[j]);
          }
        }
      }
    }
    for (long long i = 0; i < n; i++) {
      if (!used[i]) b.push_back(a[i]);
    }
    reverse(b.begin(), b.end());
    for (long long i = 0; i < n; i++) {
      cout << b[i] << " ";
    }
    cout << "\n";
  }
}
