#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
void solve(){
    ll n;
    cin >> n;
    vector<ll> a(n);
    vector<ll> cnt(3,0);
    rep(i,n){
        cin >> a[i];
        cnt[a[i]]++;
    }
    if(n<=6){
        vector<ll> v(n);
        rep(i,n) v[i]=i;
        do{
            vector<ll> b(n,0);
            rep(i,n){
                ll x=(i-1+n)%n,y=(i+1)%n;
                if(v[i]<v[x]) b[i]++;
                if(v[i]<v[y]) b[i]++;
            }
            if(b==a){
                cout << "Yes\n";
                return;
            }
        }while(next_permutation(all(v)));
        cout << "No\n";
        return;
    }
    bool ok=true;
    rep(i,n-1){
        if(a[i]==a[i+1]&&a[i]!=1) ok=false;
    }
    if(cnt[0]==0||cnt[1]==0||cnt[2]==0||!ok) cout << "No\n";
    else cout << "Yes\n";
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll t;
    cin >> t;
    while(t--){
        solve();
    }
}