#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int q; cin >> q;
    while (q--) {
        int n; cin >> n;
        vector<int> a(n);
        for (int i = 0; i < n; ++i) {
            cin >> a[i];
        }
        sort(a.begin(), a.end());
        auto slv = [&]() -> bool {
            if (a.back() <= 2) return false;
            vector<int> v;
            for (int i = 0; i < n; ++i) {
                if (a[i] > 1) v.push_back(a[i]);
            }
            if (v.size() <= 2) {
                return false;
            } else if (v.size() == 3) {
                if (v[0] == v[2]) return false;
                else return true;
            } else {
                return true;
            }
        };
        if (slv()) {
            cout << "Yes" << "\n";
        } else {
            cout << "No" << "\n";
        }
    }
}