#include<iostream.h>
/*
TASK:seq
LANG:C++
*/
long z;
long n,m,i,j,x,y,br=0,br1=0;
long a[100001];
int main()
{
 char b[100001];
cin>>n;
for(i=1;i<=n;i++)
{
 cin>>m;
 br=0;
  for(j=1;j<=m;j++)
  {cin>>a[j];}
  for(j=2;j<=m;j++)
   {
   if(a[j]<=a[j+1] && a[j]<=a[j-1])
   {
	if(a[j+1]<a[j-1])
	{
	y=a[j];
	a[j]=a[j+1];
	a[j+1]=y;
	}
	else
	{
	y=a[j];
	a[j]=a[j-1];
	a[j-1]=y;
	}
   }
   }
   x=a[1];
  for(j=2;j<=m;j++)
  {
  if(x>a[j])
   {
	br++; x=a[j];
   }
   else
   {x=a[j];}
  }
  if(br<n){br1++; b[br1]='1'; continue;}
  else
  {br1++; b[br1]='0'; continue;}
 }
 for(i=1;i<=br1;i++)
 cout<<b[i];
 cout<<endl;
return 0;
}
