#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;

int T, N, A[202020];

void solve() {
  cin >> N;
  priority_queue<int, vector<int>, less<int>> pq;
  for (int i = 1; i <= N; i++) { 
    cin >> A[i];
    pq.push(A[i]);
  }
  bool flag = true;
  int d1, d2, d3;
  while (!pq.empty()) {
    if (!pq.empty()) {
      d1 = pq.top(); pq.pop();
      d1--;
    } else {flag = false; break;}
    if (!pq.empty()) {
      d2 = pq.top(); pq.pop();
      d2--;
    } else {flag = false; break;}
    if (!pq.empty()) {
      d3 = pq.top(); pq.pop();
      d3--;
    } else {flag = false; break;}
    if (d1 > 0) pq.push(d1);
    if (d2 > 0) pq.push(d2);
    if (d3 > 0) pq.push(d3);
  }
  if (flag) cout << "Yes" << endl;
  else cout << "No" << endl;
}

int main() {
  cin >> T;
  while (T--) solve();
  return 0;
}