/*
TASK:seq
LANG:C++
*/
#include<iostream>
using namespace std;
int a[100010],b[20];
int n;
bool isok(int m){
     int c=-1;
     for(int i=1;i<=m;i++) if(a[i]!=-1)
     if(a[i]>c) c=a[i]; else return false;
     return true;
     }
     
int main(){
    cin >> n;
    for(int i=1;i<=n;i++){
            int m;
            cin >> m;
            int c;
            cin >> c;
            a[1]=-1;
            for(int j=2;j<=m;j++){cin >> a[j];if (a[j]>c){c=a[j];a[j]=-1;}}
            if(isok(m)) b[i]=1; else b[i]=0;
            }
    for(int i=1;i<=n;i++) cout << b[i];
    cout << '\n';
    return 0;
}
