#include <bits/stdc++.h>
using namespace std;
#define cs const
#define pb push_back
using pi = pair <int, int> ; 

cs int N = 5e3 + 5; 

int T, n, a[N];
int o[N];
int p[N];
int ans[N];

pi chk(int l, int r) {
    if(l > r) return pi(0, 0);
    int a = 0, b = 0;
    for(int i = l; i <=r ; i++) {
        // a for 0, b for 1
        // minimize 1 
        if(o[i] == 0) {
            if(b > 1) -- b; 
            else if(a && b) -- b; 
            else ++ a; 
        }
        else {
            ++ b; 
            if(b == 3) b -= 2; 
        }
    }  
    while(a && b && a + b >= 3) -- a, -- b; 
    // cout << a << ' ' << b << endl;
    pi ans; 
    if(!b) ans.first = -1; 
    else if(a) ans.first = 0;
    else ans.first = 1; 

    a = 0, b = 0; 
    for(int i = l; i <=r ; i++) {
        // a for 1, b for 0
        // minimize 1 
        if(o[i] == 1) {
            if(b > 1) -- b; 
            else if(a && b) -- b; 
            else ++ a; 
        }
        else {
            ++ b; 
            if(b == 3) b -= 2; 
        }
    }  
    swap(a, b);
    while(a && b && a + b >= 3) -- a, -- b; 
    // cout << a << ' ' << b << endl;
    if(!b) ans.second = -1; 
    else if(a) ans.second = 0;
    else ans.second = 1;

    // cout << "FF " << l << ' ' << r << ' ' << ans.first << ' ' << ans.second << endl;
    assert(ans.first <= ans.second); 

    return ans;
}
bool in(int x, pi a) {
    return x >= a.first && x <= a.second; 
}
bool calc(pi a, pi b) {
    if(in(0, a) && in(0, b)) return 1; 
    if(in(-1, a) && in(1, b)) return 1;
    if(in(1, a) && in(-1, b)) return 1; 
    return 0; 
}
void Main() {
    cin >> n;
    for(int i = 1; i <= n; i++) cin >> a[i], p[a[i]] = i; 
    for(int i = 1; i <= n; i++) o[i] = 1, ans[i] = 0; 
    for(int i = 1; i <= n; i++) {
        pi a = chk(1, p[i] - 1); 
        pi b = chk(p[i] + 1, n);
        // cout << i << ' ' << p[i] << ' ' << a.first << ' ' << a.second << ' ' << b.first << ' ' << b.second << endl;
        if(calc(a, b)) ans[p[i]] = 1; 
        o[p[i]] = 0; 
    }
    for(int i = 1; i <= n; i++) cout << ans[i];
    cout << '\n';
}
int main() {
    #ifdef zqj
    freopen("1.in","r",stdin);
    #endif
    ios :: sync_with_stdio(0), cin.tie(0);
    cin >> T; 
    while(T--) Main();
    return 0; 
}
/*
1 2 1 1 1 0
2 3 0 0 1 0
3 1 -1 -1 0 0
4 5 0 0 -1 -1
5 4 0 -1 -1 -1
00000
1 3 1 0 -1 -1
2 1 -1 -1 0 0
3 2 -1 -1 -1 -1
000
*/