/*
60 + 0 + 100 + 64 = 224.
*/

#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define L(i, j, k) for (int i = (j); i <= (k); i++)
#define R(i, j, k) for (int i = (j); i >= (k); i--)
#define pb push_back
#define pii pair<int, int>
inline int read()
{
	int sum = 0, nega = 1;
	char ch = getchar();
	while (ch > '9'||ch < '0')
	{
	    if (ch == '-') nega = -1;
		ch = getchar();
	}
	while (ch <= '9' && ch >= '0') sum = sum * 10 + ch - '0', ch = getchar();
	return sum * nega;
}
const int N = 3e5 + 9, mod = 998244353;
inline void add(int &x, int y) {x = (x + y) % mod;}
inline void del(int &x, int y) {x = (x - y + mod) % mod;}
int id[N];
struct node
{
	int A[9][2];
}tr[N << 2];
inline int lowbit(int x) {return x & (-x);}
inline void init()
{
	L(i, 0, 8) id[(1 << i)] = i; return ;
}
inline void Clear(node &x)
{
	L(i, 0, 8) x.A[i][0] = x.A[i][1] = 0; return ;
}
inline node Merge(node x, node y)
{
	int t, ff;
	node z; Clear(z);
	L(i, 0, 8)
	{
		t = x.A[i][0];
	//	if(t) cout << t << "awa" << endl;
		while(t) ff = lowbit(t), z.A[i][0] |= y.A[id[ff]][0], z.A[i][1] |= y.A[id[ff]][1], t -= ff;
	}
	L(i, 0, 8)
	{
		t = x.A[i][1];
		while(t) ff = lowbit(t), z.A[i][1] |= y.A[id[ff]][0], t -= lowbit(t);
	}
	return z;
}
inline int d(int x, int y) {return x * 3 + y;}
int n, a[N], cnt[N], b[N], tot, t[N], m;
inline void Set(int p, int x)
{
	node z; Clear(z); int cn = cnt[x], po;
	L(i, 0, 2)
		L(j, 0, 2)
		{
			if(i + j <= cn)
			{
				po = cn - i - j;
				z.A[d(i, j)][0] |= (1 << d(j, po % 3));
			}
			if(i + j + 2 <= cn)
			{
				po = cn - i - j - 2;
				z.A[d(i, j)][1] |= (1 << d(j, po % 3));
			}
		}
	tr[p] = z; return ;
}
inline int lc(int p) {return p << 1;}
inline int rc(int p) {return p << 1 | 1;}
inline void push_up(int p) {tr[p] = Merge(tr[lc(p)], tr[rc(p)]); return ;}
inline void build(int l, int r, int p)
{
	Clear(tr[p]); tr[p].A[0][0] = 1;
	if(l == r)
		return ;
	int mid = (l + r) >> 1;
	build(l, mid, lc(p)); build(mid + 1, r, rc(p));
	return ;
}
inline void update(int l, int r, int p, int pos)
{
	if(l == r) {Set(p, l); return ;}
	int mid = (l + r) >> 1;
	if(mid >= pos) update(l, mid, lc(p), pos);
	else update(mid + 1, r, rc(p), pos);
	push_up(p);
//	cout << l << " " << r << "awa" << endl;
//	L(i, 0, 8)
//		L(j, 0, 1)
//		{
//			int v = tr[p].A[i][j];
//			while(v)
//			{
//				cout << i << " " << j << " " << id[lowbit(v)] << endl;
//				v -= lowbit(v);
//			}
//		}
	return ;
}
inline void solve()
{
	n = read(); tot = 0;
	L(i, 1, n) a[i] = read(), b[++tot] = a[i];
	sort(b + 1, b + tot + 1);
	int mer = unique(b + 1, b + tot + 1) - b - 1; tot = mer;
	t[1] = 1;
	L(i, 2, tot)
	{
		if(b[i] - b[i - 1] > 1) t[i] = t[i - 1] + 2;
		else t[i] = t[i - 1] + 1;
	}
	m = t[tot];
	L(i, 1, m) cnt[i] = 0;
	build(1, m, 1);
	L(i, 1, n) a[i] = lower_bound(b + 1, b + tot + 1, a[i]) - b, a[i] = t[a[i]];
	L(i, 1, n)
	{
	//	cout << a[i] << " " << m << endl;
		cnt[a[i]]++; update(1, m, 1, a[i]);
		if(tr[1].A[0][1] & 1) putchar('1');
		else putchar('0');
	}
	puts(""); return ;
}
signed main()
{
	int T = read(); init();
	L(i, 1, T) solve();
	return 0;
}