problem/1856/B

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}

bool sh = 0;

void slv() {
    ll n, ones=0, s=0;
    vector <ll> a;
    cin >> n;
    a.resize(n);


    for (int i = 0; i < n; ++i) {
        cin >> a[i];
        s += a[i];
        if (a[i ]== 1) {
            ones++;
        }
    }
    if (n == 1) {
        cout << "NO\n";
        return;
    }
    if (sh) {
        cout << "n = " << n << "\n";
        cout << "asz " << a.size() << "\n";
        cout << "ones = " << ones << "\n";
        cout << "s = " << s << "\n";
    }
    ll odd = s - ones - (n - ones);
    if (odd >= ones) {
        cout << "YES\n";
    } else {
        cout << "NO\n";
    }
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    cin >> t;
    for (int go = 0; go < t; ++go) {
        slv();
    }
}