#include <iostream>
#include <cstdio>
#include <string>
#include <vector>
#include <map>
#include <cstring>
#include <iterator>
#include <cmath>
#include <algorithm>
#include <stack>
#include <deque>

#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
using namespace std;
const int maxn = 1e5 + 100;
int a[maxn];
int pos[maxn];

int cmp( int i, int j ) {
    return a[i] > a[j];
}

int main() {
    int t;
    scanf( "%d", &t );
    while( t-- ) {
        int n;
        scanf( "%d", &n );
        for( int i = 1; i <= n; i++ ) {
            scanf( "%d", a+i );
            pos[i] = i;
        }
        sort( pos+1, pos+n+1, cmp );
        int flag = 1;
        for( int i = 2; i <= n; i++ ) {
            int j;
            for( j = 1; j <= n; j++ ) {
                if(pos[j] % i != 0) break;
            }
            if( flag ) {
                flag = 0;
                printf( "%d", a[pos[j]] );
            }
            else {
                printf( " %d", a[pos[j]] );
            }
        }
        printf( "\n" );
    }
    return 0;
}