#include <bits/stdc++.h>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()

using namespace std;
using ll = long long;
using pii = pair<int, int>;

void solve() {
    int n; cin >> n;
    vector<int> d(n);
    for (int i = 0; i < n; i++) {
        cin >> d[i];
    }
    sort(all(d), [](int x, int y){ return x > y; });
    while (d.size() && d.back() == 1) d.pop_back();
    if (d.size() <= 2) {
        cout << "No" << '\n';
        return;
    }
    set<int> S(all(d));
    if (S.size() == 0) {
        cout << "No" << '\n';
        return;
    }
    if (S.size() == 1) {
        int k = *S.begin();
        if (k == 2) {
            cout << "No" << '\n';
        } else {
            if (d.size() >= 4) {
                cout << "Yes" << '\n';
            } else {
                cout << "No" << '\n';
            }
        }
    } else {
        cout << "Yes" << '\n';
    }
}

signed main() {
#ifndef LOCAL
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
#endif
    int T = 1;
    cin >> T;
    while (T--) solve();
    return 0;
}