#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

inline bool getmin(int &a, int b) {return (a > b ? (a = b, true) : false);}
inline bool getmax(int &a, int b) {return (a < b ? (a = b, true) : false);}

#define N 5007

int a[N], b[N];

inline int getmax(int l, int r, int tar) {
    int cnt = 0, sum = 0;
    for (int i = l; i <= r; ++i) {
        if (b[i] == tar) {
            if (cnt) --cnt;
            else sum += tar;
        } else {
            ++cnt;
            if (cnt >= 3) cnt -= 2;
        }
    }
    return -tar * cnt + sum;
}

inline void work() {
    int n = rd();
    for (int i = 1; i <= n; ++i) a[i] = rd();
    for (int i = 1; i <= n; ++i) {
        int sum = 0;
        for (int j = 1; j <= n; ++j) 
            if (j != i) {
                b[j] = (a[j] > a[i] ? 1 : -1);
                sum += b[j];
            }
        if (sum == 0) {putchar('1'); continue;}
        else {
            if (sum > 0 && getmax(1, i - 1, -1) + getmax(i + 1, n, -1) <= 0) {putchar('1'); continue;}
            if (sum < 0 && getmax(1, i - 1, 1) + getmax(i + 1, n, 1) >= 0) {putchar('1'); continue;}
        }   
        putchar('0');
    }
    puts("");
}

int main() {
    for (int t = rd(); t; --t) work();
    return 0;
}