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

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

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];
        }
        auto check = [&]() -> bool {
            vector<int> v;
            for (int i = 0; i < n; ++i) {
                if (a[i] != 1) v.push_back(a[i]);
            }
            if (v.size() == 0) return false;
            v.push_back(v[0]);
            for (int i = 0; i+1 < v.size(); ++i) {
                if (v[i] == v[i+1]) return false;
            }
            return true;
        };

        if (check()) cout << "Yes\n";
        else cout << "No\n";
    }
}