#include<bits/stdc++.h>
using namespace std;

ifstream fin("perle.in");
ofstream fout("perle.out")

const int NMAX=10005;

int t,n,a[NMAX],b[NMAX];

inline bool Solve()
{
    int i,j,aux,len=1;
    i=1;
    while (i<=n)
        if (b[i]<=3)
            {
                if (b[i]!=a[i]) return 0;
                else i++;
            }
        else
            {
                if (b[i]==4) i++;
                else
                {
                    aux=len-i;//cate trebuie mutate
                    if (b[i]==5)
                        {

                        }
                    else
                        {

                        }
                }
            }
}

int main()
{
    int i;
    bool ok;
    fin>>t;
    while (t--)
        {
            fin>>n;ok=0;
            for (i=1;i<=n;i++) fin>>a[i];
            //incercam A
            if (n==1) ok=1;
            //incercam B
            b[0]=1;b[1]=5;
            if (Solve()==1) ok=1;
            //incercam C
            b[0]=1;b[1]=6;
            if (Solve()==1) ok=1;

            fout<<ok<<"\n";
        }
    return 0;
}