#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<bitset>
#define N 105
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int T,n,a[N],ans,x,y,z;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("dump.in","r",stdin);freopen("dump.out","w",stdout);
	T=read();
	while(T--)
	{
		n=read();fo(i,1,n)a[i]=a[i-1]^read();
		bitset<N>b[N][N];
		fo(i,1,n)b[i][i][i]=1;
		fo(len,2,n)
			for(int i=1,j=i+len-1;j<=n;i++,j++)
				fo(k,i,j-1)
				{
					x=a[k]^a[i-1];y=a[j]^a[k];
					if(x>y)b[i][j]|=b[i][k];
					if(x<y)b[i][j]|=b[k+1][j];
					if(x==y)b[i][j]|=b[i][k]|b[k+1][j]; 
				}
		fo(i,1,n)printf("%d",b[1][n][i]?1:0);
		printf("\n"); 
	}
	return 0;
}