/*
TASK:seq
LANG:C++
*/
#define MAXM 10000

#include <iostream>
#include <queue>

using namespace std;

queue<bool> q;

int n, m;
char a[2*MAXM+5];

int main()
{
    scanf("%d\n", &n);
    
    for (int i=1; i<=n; i++)
        {
             int len1=0, len2=0;
             char end1='0', end2='0';
             int j;
             
             scanf("%d ", &m);
             gets(a);
             
             m*=2;
             m--;
             
             for (j=0; j<=m; j+=2)
                 {
                       if (a[j]>end1) { end1=a[j]; len1++; }
                          else if (a[j]>end2) { end2=a[j]; len2++; }
                                  else { q.push(0); break; }
                 }
             
             if (j>m)
                {
                     if (!len1)
                        if (len2>1) q.push(1);
                           else q.push(0);
                        
                        else if (!len2)
                                if (len1>1) q.push(1);
                                   else q.push(0);
                                
                                else q.push(1);
                }
        }
    
    while (!q.empty())
          {
                        printf("%d", q.front());
                        q.pop();
          }
    
    printf("\n");
    
return 0;
}
