// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define cmin(x,...) x=min({(x), __VA_ARGS__})
#define cmax(x,...) x=max({(x), __VA_ARGS__})
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define double long double
#define int long long
#define MAXN 200010

// void simulate(vector<int> &p) {
//     vector<int> result;
//     for (auto x: p) {
//         result.insert(result.begin() + x, 0);
//         rep(i, 0, x) result[i] ^= 1;
//     }
//     debug(result);
// }

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    rep(i, 0, n) cin >> a[i];
    if (*a.rbegin() == 1) {
        cout << "NO" << endl;
        return;
    }
    vector<pair<int, int>> itv;
    for (int i = n-1; i >= 0; ) {
        int zero = 0, one = 0;
        while (i >= 0 && a[i] == 0) --i, ++zero;
        while (i >= 0 && a[i] == 1) --i, ++one;
        itv.push_back({zero, one});
    }
    vector<int> p;
    for (auto [zero, one] : itv) {
        rep(i, 0, zero+one-1) p.push_back(0);
        p.push_back(one);
    }
    cout << "YES" << endl;
    rep(i, 0, sz(p)) cout << p[i] << " \n"[i == sz(p)-1];
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int _; cin >> _;
    while (_--) solve();

    return 0;
}