/*
TASK:seq
LANG:C++
*/
#include <iostream>
bool s[20],b[100000];
int a[100000],p,n,m,f,t;
int check()
    {
     int i,j,c=-1;
     for(i=0;i<m;i++)
                     if(a[i]<c&&b[i]==0)return 0;
                     else if(b[i]==0)c=a[i];
     return 1;
     }
int rec()
    {
     if(f==1)return 0;
     if(f==2)return 1;
     if(check()==1)f=2;
     if(f==2)return 1;
     int i,j,x,y,z;
     x=t;
     y=p;
     for(i=p+1;i<m;i++)
          {
          if(f==2)return 1;
          if(a[i]>t)
                    {
                     t=a[i];
                     b[i]=1;
                     p=i;
                     rec();
                        }
          else b[i]=0;
          }
     if(i==m)f=1;
     if(check()==1)f=2;
     t=x;
     y=p;
     }
int main ()
{
int i,j,k;
scanf("%d",&n);
for(i=0;i<n;i++)
       {
        for(j=0;j<m;j++)b[j]=false;
        f=0;
        scanf("%d",&m);
        for(j=0;j<m;j++)scanf("%d",&a[j]);
        t=a[0];
        b[0]=1;
        p=0;
        if(rec()==1)s[i]=1;
        }
for(i=0;i<n;i++)printf("%d",s[i]);
printf("\n");
}
