/** * author: shu8Cream * created: 28.01.2022 23:13:40 **/ #include using namespace std; #define rep(i,n) for (int i=0; i<(n); i++) #define rrep(i,n) for (int i=(n-1); i>=0; i--) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define sz(x) int((x).size()) using ll = long long; using P = pair; using vi = vector; using vvi = vector; const ll INF = 8e18; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; } template string to_string(T s); template string to_string(pair p); string to_string(char c) { return string(1, c); } string to_string(string s) { return s; } string to_string(const char s[]) { return string(s); } template string to_string(T v) { if (v.empty()) return "{}"; string ret = "{"; for (auto x : v) ret += to_string(x) + ","; ret.back() = '}'; return ret; } template string to_string(pair p) { return "{" + to_string(p.first) + ":" + to_string(p.second) + "}"; } void debug_out() { cout << endl; } template void debug_out(Head H, Tail... T) { cout << to_string(H) << " "; debug_out(T...); } #ifdef _DEBUG #define debug(...) debug_out(__VA_ARGS__) #else #define debug(...) #endif void solve(){ ll n; cin >> n; vi a(n); rep(i,n) cin >> a[i]; priority_queue pq; rep(i,n) pq.push(a[i]); bool f = true; while(1){ if(pq.empty()) break; vi v(3); rep(i,3){ if(pq.empty()){ f = false; continue; } ll t = pq.top(); pq.pop(); v[i] = t; } if(!f) break; ll diff = v[2]-pq.top()+1; v[0]-=diff; v[1]-=diff; v[2]-=diff; rep(i,3) if(v[i]) pq.push(v[i]); } cout << (f ? "Yes" : "No") << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); int t; cin >> t; while(t--) solve(); }