#include<cstdio>
using namespace std;
int lg,n;
int a[10001],k;
int putC();
int putB();
int main()
{
    freopen("perle.in","r",stdin);
    freopen("perle.out","w",stdout);
    scanf("%d",&n);
    for (int o=1;o<=n;++o)
    {
        scanf("%d",&lg);
        for (int i=1;i<=lg;++i) scanf("%d",&a[i]);
        k=1;
        if (lg==1) printf("1\n");
        else
        {
            if (a[1]==2 || (a[1]==1 && a[3]==3 && lg>=5)) printf("%d\n",putB());
                else printf("%d\n",putC());
        }
    }
    return 0;
}
int putB()
{
    if (k>lg) return 0;
    int r=0;
    if (a[k]==2) {++k;r=putB();}
    else
    {
        if (a[k]==1 && a[k+2]==3 )
        {
            k+=4;
            r=putC();
        }
    }
    return r;
}
int putC()
{
    if (k>lg) return 0;
   if (a[k]==2)
   {
       ++k;
       return 1;
   }
   else if (a[k]==3)
   {
       ++k;
       if (putB()) return putC();
   }
   else if(a[k]==1 && a[k+1]==2 && k+2<=lg)
   {
       k+=3;
       return 1;
   }
   return 0;
}