/*
Task:seq
Lang:C++
*/
#include <iostream>
using namespace std;
int main()
{int n,m,i,j,rez[11],r=0,answ,br;
 long int p[100001],p1[100001];
 cin>>n;
 for(j=1;j<=n;j++)
 {cin>>m;
  answ=0;
  for(i=0;i<m;i++)
      {cin>>p[i];
       p1[i]=p[i];
       }
  sort(&p[0],&p[m]);
  for(i=1;i<m;i++)
     if(p[i-1]==p[i]) {answ=1;break;}
  if(answ) {i=1;br=1;
            while(answ && i<m)
              { 
              if(p[i-1]==p[i]) br++;
              else if(br>2) {answ=0;break;}
                   else br=1;
              i++;
              }
              
            }
  int last1,last2=-13;
  if(answ)
         {last1=p1[0];
          for(i=1;i<m;i++)
             if(p1[i]>last1) last1=p1[i];
             else if(p1[i]>last2) last2=p1[i];
                   else {answ=0;break;}
         }                          
  if(answ) rez[r]=1;
  else rez[r]=0;
  r++;
    
 }   
 for(i=0;i<r;i++)
     cout<<rez[i];
 cout<<'\n' ;
 return 0;
}
 
