#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/extc++.h>
using namespace std;
using ld = long double; 
const vector<int> dx = {0, 0, 1, -1};
const vector<int> dy = {1, -1, 0, 0};
#define vec vector
#define int long long
#define double long double
//cout<<setprecision(10)<<fixed<<..
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repp(i, x, n) for (int i = x; i < (int)(n); i++)
#define pii pair<int,int>
#define pq priority_queue

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    int t;cin>>t;
    rep(i,t){
        int n;cin>>n;
        deque<int> A;
        set<int> S;
        rep(i,n){
            int a;
            cin>>a;S.insert(a);
            A.push_back(a);
        }
        if(*S.begin()==1){cout<<"No\n";continue;}
        bool f=true;
        n=A.size();
        if(A[0]==1){
            if(A[n-1]==2&&A[1]==2){f=false;}
            if(A[n-1]==0&&A[1]==0){f=false;}
        }
        if(A[0]==0){
            if(A[n-1]==0||A[1]==0){f=false;}
        }
        if(A[0]==2){
            if(A[n-1]==2||A[1]==2){f=false;}
        }
        int pos=A[0];
        for(int i=1;i<n;i++){
            if(!f){break;}
            if(A[i]==1){
                if((A[i-1]==0&&A[(i+1)%n]==0)||(A[i-1]==2&&A[(i+1)%n]==2)){
                    f=false;break;
                }
            }
            if(A[i]==0){
                if(pos==0){f=false;}
                if(A[i-1]==0||A[(i+1)%n]==0){f=false;break;}
                pos=0;
            }
            if(A[i]==2){
                if(pos==2){f=false;}
                if(A[i-1]==2||A[(i+1)%n]==2){f=false;break;}
                pos=2;
            }
        }
        if(f){
            cout<<"Yes\n";
        }else{
            cout<<"No\n";
        }
    }

}