#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>   
using namespace std;
using namespace __gnu_pbds;
typedef long long ll; 
#define int long long
typedef unsigned long long lu;
typedef vector<ll> v;
typedef vector<vector<ll> > vv;
typedef vector<string>  vs;
typedef vector<pair<ll,ll>> vpr;
typedef long double ld;
#define f(i,n) for(ll i = 0; i < n; i++)
#define ff(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define endl "\n"
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define amax(x,y) if(y>x) x=y;
#define amin(x,y) if(y<x)x=y;
#define bg(x) x.begin()
#define sz(x) (ll)x.size()
#define in(x,n) for(ll i=0;i<n;i++)cin>>x[i]
#define out(x,n) for(ll i=0;i<n;i++)cout<<x[i]<<" " 
#define mxt(a) *(max_element(a.begin(),a.end()))
#define mnt(a) *(min_element(a.begin(),a.end())
#define tc ll t;cin>>t;while(t--)
typedef pair<ll,ll> pi;
#define yes cout<<"YES\n";
#define no cout<<"NO\n";
#define yesno(f) if(f) yes else no
const v dx = {1, -1, 0, 0};
const v dy = {0, 0, 1, -1};
const ld PI = 2 * acos(0.0);
ll cel(ll x1,ll y1){if((x1%y1)==0)return x1/y1;else return x1/y1+1;}
ll power(ll a,ll b,ll m)
{
    if(b==0)
        return 1;
    ll d=power(a,b/2,m);
    d=(d*d)%m;
    if(b&1)
        d=(d*a)%m;
    return d;
}
const ll mod=1e9+7;
int MOD(int a)
{
    if(a<0)
        a+=mod;
    if(a>=mod)
        a%=mod;
    return a;
}
// set_name.find_by_order(k) It returns to an iterator to the kth element (counting from zero) in the set in O(logn) time
// set_name.order_of_key(k) It returns to the number of items that are strictly smaller than our item k in O(logn) time.
/*string operations :
str.substr (x,y) : returns a substring str[x],str[x+1],...str[x+y-1]
str.substr (x) : returns a substring str[x],... end of string
str.find(qtr) : returns the first occurenece of qtr in str */
const double EPS = 1e-9;
const int INF = 2; // it doesn't actually have to be infinity or a big number
int gauss (vector < vector<int>  > a, int n, int m, vector<int> & ans) {
    vector<int> where (m, -1);
    for (int col=0, row=0; col<m && row<n; ++col) {
        for (int i=row; i<n; ++i)
            if (a[i][col]) {
                swap (a[i], a[row]);
                break;
            }
        if (! a[row][col])
            continue;
        where[col] = row;

        for (int i=0; i<n; ++i)
            if (i != row && a[i][col])
            {
                for(int j=0;j<sz(a[i]);j++)
                    a[i][j]^=a[row][j];
                // a[i] ^= a[row];
            }
        ++row;
    }
        // The rest of implementation is the same as above
    ans.assign (m, 0);
    for (int i=0; i<m; ++i)
        if (where[i] != -1)
            ans[i] = a[where[i]][m] / a[where[i]][i];
    for (int i=0; i<n; ++i) {
        int sum = 0;
        for (int j=0; j<m; ++j)
            sum += ans[j] * a[i][j];
        sum%=2;
        a[i][m]%=2;
        if (sum != a[i][m])
            return 0;
            // exit(0);
    }

    for (int i=0; i<m; ++i)
        if (where[i] == -1)
            return INF;
    return 1;
}
bool fun(v &arr,int k)
{

     arr.pb(k);
     int n=sz(arr);
     vv mat(60,v(n));
     for(int i=0;i<n;i++)
     {
        bitset<60>bits(arr[i]);
        for(int j=0;j<60;j++)
        {
            mat[j][i]=(int)bits[j];
            // cout<<mat[]
        }
     }
     // for(int i=0;i<60;i++)
     // {
     //    for(int j=0;j<n;j++)
     //    {
     //        cout<<mat[i][j]<<" ";
     //    }
     //    cout<<endl;
     // }
     // exit(0);
     v ans;
     if(gauss(mat,60,n-1,ans)>0)
     {
        // for(auto it:ans)cout<<it<<" ";
            // cout<<endl;
        // cout<<" above is v:\n";
        return true;
     }
    return false;


}
bool solve()
{
    int n;cin>>n;
        v arr(n);in(arr,n);
        string str;cin>>str;
        for(int i=0;i<n;i++)
        {
            if(str[i]=='1')
            {
                
                v vec;
                for(int j=i+1;j<n;j++)
                {
                    vec.pb(arr[j]);
                }
                if(sz(vec)==0)
                    return false;

                if(!fun(vec,arr[i]))
                    return false;
            }
        }
        return true;
}
int32_t main()
{
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
    tc{
        if(solve())
            cout<<0<<endl;
        else
            cout<<1<<endl;
    }
    return 0;
}

Measured memory_bytes: 4108