#include <bits/stdc++.h>
//
#define var auto
#define let auto const
#define mid ((l + r) >> 1)
#define loop for (;;)
#define downTo(n) for (int it{n}; it; --it)
#define repeat(n) for (int it{1}, ed{n}; it <= ed; ++it)
typedef long long Int;
typedef long double real;

int i32() {
    int a{}, b{}, sgn{};
    for (; !isdigit(b); b = getchar()) sgn = b == '-';
    for (; +isdigit(b); b = getchar()) a = a * 10 + b - '0';
    return sgn ? -a : +a;
}

const int N = 5050;
int a[N];
int b[N];
int id[N];

void solve() {
    let n = i32();
    std::map<int, int> map;
    repeat(n) map[a[it] = i32()]++;
    for (let o: map)
        if (o.second >= 3) {
            puts("NO");
            return;
        }
    repeat(n) {
        b[it] = 0;
        for (int i = 0; i < 30; ++i) {
            if ((a[it] >> i) & 1)
                b[it] += 1 << (29 - i);
        }
    }
    puts("YES");
    repeat(n) id[it] = it;
    std::sort(id + 1, id + n + 1, [&](int x, int y) { return b[x] < b[y]; });
    repeat(n) printf("%d%c", a[id[it]], " \n"[it == n]);
}

int main() {
    repeat(i32()) {
        solve();
    }
}