/*
TASK:seq
LANG:C++
*/
#include <iostream>

using namespace std;
long int N,M,seq1[100000],seq2[100000],a,i1=0,i2=0,res=1;
int main()
{
 cin >> N;
 for (int i=1;i<=N;i++)
     {
      res=1;
      cin >> M;
      for (int t=1;t<+M;t++)
          {
           cin >> a;
           if (a > seq1[i1]) {
                              seq1[i1+1]=a;
                              i1++;
                             }
           else if (a > seq2[i2]) {
                                   seq2[i2+1]=a;
                                   i2++;
                                  }
           else {
                 res=0;
                 break;
                 }
          }
      if (i2==0) res=0;                                              
      cout << res;
      for (int j=0;j<100000;j++)
           {
            seq1[j]=0;
            seq2[j]=0;
           }
      i1=0;i2=0;     
      }                                                 
 cout <<"\n";
return 0;

}
