/*
TASK:seq
LANG:C++
*/
#include <iostream>
#include <string>
using namespace std;
int main()
{
    int N,i,j,e[100000],M,o=1;
    cin>>N;
    for(i=1;i<=N;i++)
    {cin>>M;
     for(j=1;j<=M;j++)
     cin>>e[j];
     for(j=2;j<=M;j++)
     if(e[j]>e[1])
     {e[1]=e[j];
      e[j]=-1;
     }
     for(j=2;j<=M;j++)
     if(e[j]>-1)
     {e[1]=e[j];
     break;
     }
     for(j=2;j<=M;j++)
     if(e[j]<e[1]&& e[j]!=-1)
     {o=0;     
     }
     else     
     e[1]=e[j];
     cout<<o;
    }     
    return 0;
}    
        
