#include<bits/stdc++.h>
#define int long long
#define ll long long
#define pir pair<int,int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
using namespace std;
inline int re()
{
    int f=1,num=0;
    char c=getchar();
    while(c<'0'||c>'9'){if(c=='-') f=-1;c=getchar();}
    while(c>='0'&&c<='9') num=num*10+c-'0',c=getchar();
    return num*f;
}
int T;
void clear();
const int N=3010;
int n;
int a[N];
int dp[N][N];
int highbit(int x)
{
    if(x==0) return (1ll<<61);
    return (1ll<<__lg(x));
}
int hbit(int x)
{
    if(x==0) return 61;
    return __lg(x);
}
int L[N][70],R[N][70];
int s[N];
int xorc(int l,int r){return s[r]^s[l-1];}
void work()
{
    clear();
    n=re();
    for(int i=1;i<=n;i++) a[i]=re();
    for(int i=1;i<=n;i++) s[i]=s[i-1]^a[i];
    dp[1][n]=1;
    L[1][hbit(xorc(1,n))]=1;
    R[n][hbit(xorc(1,n))]=1;
    for(int len=n-1;len>=1;len--)
    {
        for(int l=1;l+len-1<=n;l++)
        {
            int r=l+len-1;
            bool flag=0;
            for(int w=xorc(l,r);;w-=highbit(w))
            {
                flag|=L[l][hbit(w)];
                flag|=R[r][hbit(w)];
                if(w==0) break;
            }
            if(flag==0) continue;
            dp[l][r]=1;
            L[l][hbit(xorc(l,r))]=1;
            R[r][hbit(xorc(l,r))]=1;
        }
    }
    for(int i=1;i<=n;i++) printf("%d",dp[i][i]);
    printf("\n");
    return;
}
signed main()
{
    freopen("dump.in","r",stdin);
    freopen("dump.out","w",stdout);
    T=re();
    while(T--) work();
    return 0;
}
void clear()
{
    for(int i=1;i<=n;i++)
    {
        s[i]=a[i]=0;
        for(int j=1;j<=n;j++) dp[i][j]=0;
        for(int j=0;j<=69;j++) L[i][j]=R[i][j]=0;
    }
    return;
}