/*
TASK: seq
LANG: C++
*/
#include<iostream.h>
	long a[100555],b[100555],o[40];
	long br,br1,br0,c,n,fl,min;
int main()
{
cin>>n;
for(br=1; br<=n; br++)
{
 cin>>c;
 fl=1;
 br0=1;
 for(br1=1; br1<=c; br1++) cin>>a[br1];
 b[1]=1;
 for(br1=1; br1<=c-1; br1++) if(a[br1]<a[br1+1]) b[br1+1]++;
 while(b[br0]==1) br0++;
 min=a[br0+1];
 for(br1=br0; br1<=c-1; br1++)
  if(min<a[br1+1] && b[br+1]!=0)
  {
   b[br1+1]++;
   min=a[br1+1];
  }
 for(br1=1; br1<=c; br1++)
  if(b[br1]==0) fl=0;
   else b[br1]=0;
 o[br]=fl;
}
for(br1=1; br1<=n; br1++) cout<<o[br1];
cout<<endl;
return 0;
}