#include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long po(long long x) { return ((x % mod) + mod) % mod; }
long long SM(long long x, long long y) { return (po(x) + po(y)) % mod; }
long long M(long long x, long long y) { return (po(x) * po(y)) % mod; }
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
long long rand(long long x, long long y) {
  return uniform_int_distribution<long long>(x, y)(rng);
}
long long t = 1, n, i, j, k, x, y, z, l, r, mid, m, ans;
long long a[400005], b[400005], c[400005], d[400005];
map<long long, long long> mp;
string s, st;
vector<long long> v[300005], u;
long long ff() {
  x = 0;
  u.clear();
  cin >> n;
  for (i = 0; i < n; i++) cin >> a[i], x += a[i];
  if (x % 2 || x == n) return cout << "NO", 0;
  if (x == 0) return cout << "YES\n0", 0;
  if (a[0]) {
    for (i = 0; i + 2 < n; i++)
      if (a[i] + a[i + 1] + a[i + 2] == 1) {
        a[i] = a[i + 1] = a[i + 2] = 1;
        u.push_back(i + 1);
      } else if (a[i] + a[i + 1] + a[i + 2] == 2 && i % 2 == 0) {
        a[i] = a[i + 1] = a[i + 2] = 0;
        u.push_back(i + 1);
        break;
      }
    if (i + 2 == n) return cout << "NO", 0;
    while (i >= 0) {
      if (a[i] + a[i + 1] + a[i + 2] == 2) {
        a[i] = a[i + 1] = a[i + 2] = 0;
        u.push_back(i + 1);
      }
      i--;
    }
  }
  for (i = 0; i + 2 < n; i++)
    if (a[i] + a[i + 1] + a[i + 2] == 2) {
      u.push_back(i + 1);
      a[i] = a[i + 1] = a[i + 2] = 0;
    } else if (a[i] && a[i + 1] + a[i + 2] == 0) {
      u.push_back(i + 1);
      u.push_back(i);
      swap(a[i], a[i + 2]);
    }
  cout << "YES";
  cout << "\n" << u.size() << "\n";
  for (auto i : u) cout << i << " ";
  return 0;
}
int main() {
  ios::sync_with_stdio(NULL);
  cin.tie(0);
  cout.tie(0);
  cin >> t;
  while (t--) {
    ff();
    cout << "\n";
  }
}
