#include <bits/stdc++.h>
using namespace std;

void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '('; __print(x.first); cerr << ", "; __print(x.second); cerr << ')';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << " > [" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif

void erase(map<int, int>& A, int x) {
    if(A[x] == 1) A.erase(x);
    else A[x]--;
}

void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    vector<int> b;
    map<int, int> A;
    int maxx = 0;
    for(int i = 0; i < n; i++) {
        cin >> a[i];
        A[a[i]]++;
        maxx = max(maxx, a[i]);
    }
    b.push_back(maxx);
    int GCD = maxx;
    erase(A, maxx);
    int timer = 0;
    while(!A.empty() and timer++ < 10) {
        maxx = -1;
        for(auto v : A) {
            if(maxx == -1) maxx = v.first;
            else if(__gcd(v.first, GCD) > __gcd(maxx, GCD)){
                maxx = v.first;
            }
        }
        GCD = __gcd(GCD, maxx);
        erase(A, maxx);
        b.push_back(maxx);
    }
    for(auto x : b) cout << x << " ";
    cout << "\n";
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int t;
    cin >> t;
    while(t--) {
        solve();
    }

    return 0;
}
