#include <bits/stdc++.h>
using namespace std;
#define f(i, x, n) for(int i = x; i < (int)(n); ++i)
#define ll long long
const int N = 1000005;
int q, a[200001], c[200001];
pair <int, int> b[200001];
int main(){
	int n;
    cin  >> q;
    while(q--){
    	cin >> n;
    	for(int i = 1; i <= n; ++i){
    		scanf("%d", &a[i]);
    		b[i] = make_pair(a[i], i);
    	}
    	c[1] = 1;
    	sort(b + 1, b + n + 1);
    	int mn = 2000000, mx = 1;
    	for(int i = 1; i <= n; ++i){
    		mx = max(mx, b[i].second);
    		mn = min(mn, b[i].second);
    		if(mx - mn == i - 1){
    			c[i] = 1;
    		}
    		else{
    			c[i] = 0;
    		}
    	}
    	for(int i = 1; i <= n; ++i){
    		cout << c[i];
    	}
    	cout << endl;
    }
    return 0;}