#include <bits/stdc++.h>

using namespace std;


#define ar array
#define ll long long
#define ld long double
#define sza(x) ((int)x.size())
#define all(a) (a).begin(), (a).end()
#define nl cout << '\n';
#define str string
#define YES cout << "YES\n";
#define NO cout << "NO\n";
#define fxd(n) fixed << setprecision(n) // cout
#define pi 3.14159265359
#define loopr(i, a, b) for(int i = a; i <= b; ++i)
#define loop(i, n) for(int i = 0; i < n; ++i)
#define sorts(X) sort(X.begin(), X.end())
#define sortt(X, n) sort(X, X + n)
#define rev(X, n) reverse(X, X + n)
#define all(X) X.begin(), X.end()
#define sz size()
#define F first
#define S second

const int MAX_N = 1e5 + 5;
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ld EPS = 1e-9;

// parts so that in the left part the number of ones is at least the total number of twos and threes
// middle part the total number of ones and twos is at least the number of threes
// right part can be anything, but it must be non-empty




void solve() {
    
    int n ; cin>>n;

    vector<int>  st ;
    vector<int> v(n+1) ;

    vector<int> pf1(n+1);
    vector<int> pf2(n+1);



    for (int i = 1; i <= n ; i++)
    {
        cin>>v[i];

        if(v[i]==1){

            pf1[i]=1;
        }else{
            pf1[i]=-1;
        }

        if(v[i]==3){

            pf2[i]=-1;
        }else{
            pf2[i]=1;
        }

    }
    
    for (int i = 1; i < n ; i++){

        pf1[i]+=pf1[i-1];
        pf2[i]+=pf2[i-1];

    }
    
    // for (int i = 1; i <= n ; i++)
    // {
    //     cout<<pf1[i]<<' ';
    // }
    
    // cout<<'\n';
    
    // for (int i = 1; i <= n ; i++)
    // {
    //     cout<<pf2[i]<<' ';
    // }


    for (int i = 1; i < n - 1; i++)
    {

        if(pf1[i]>=0){


            for (int j = i+1 ; j<n ; j++)
            {
                

                if((pf2[j]-pf2[i])>=0){

                    YES
                    return ;
                }

            }
        


        }
    }

    NO
    
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case #" << t << ": ";
        solve();
    }
}