#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
const long long INF = 1e18;
template <class T> constexpr T inf = numeric_limits<T>::max() / 2.1;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T> inline void chmax(T &a, const T &b) { if ((a) < (b)) (a) = (b); }
template <class T> inline void chmin(T &a, const T &b) { if ((a) > (b)) (a) = (b); }
template <typename X, typename T> auto make_table(X x, T a) { return vector<T>(x, a); }
template <typename X, typename Y, typename Z, typename... Zs> auto make_table(X x, Y y, Z z, Zs... zs) { auto cont = make_table(y, z, zs...); return vector<decltype(cont)>(x, cont); }

#define cdiv(a, b) (((a) + (b)-1) / (b))
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x) sort(all(x)); x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef long double ld;
using vl = vector<ll>;
using vvl = vector<vl>;
using pll = pair<ll, ll>;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
void check_input() { assert(cin.eof() == 0); int tmp; cin >> tmp; assert(cin.eof() == 1); }

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve.cpp"
template<class T=ll> using vec = vector<T>;
struct Fast { Fast() { std::cin.tie(0); ios::sync_with_stdio(false); } } fast;

// snippet:to_bin {{{
string to_bin(ll n, ll d = 10){
    // nをd桁の2進数で表示する。
    stringstream ss;
    ss << bitset<64>(n);
    return ss.str().substr(64-d, d);
}
// ll d = (32 - __builtin_clz(n));  // 最大桁のd: (2^d)
// ll f = N - d; to_bin()で返ってきた文字列で最初に1が立っているindex
// snippet:to_bin }}}

vector<ll> hakidasi(vector<ll>& a){
    dump(a);
    int n = sz(a);
    int r = 0;
    vector<int> top(n);
    for (int i = 61; i >= 0; --i) {
        int j = r;
        for (; j < n; ++j) {
            if (a[j]>>i&1) {
                swap(a[r],a[j]);
                break;
            }
        }
        if (j == n) continue;
        top[r] = i;
        rep(k,n) {
            if (r == k) continue;
            if (a[k]>>i&1) a[k] ^= a[r];
        }
        ++r;
    }
    vl res;
    rep(i, r) res.pb(a[i]);
    dump(r);
    return res;
}

int solve(string s, ll mask){
    return 0;
}

ll query(){
    cerrendl;/*{{{*/
    ll n;cin>>n;
    dump(n);
    vector<ll> a(n);
    rep(i, n) { cin>>a[i]; }
    reverse(all(a));
    dump(a);
    string s;cin>>s;
    reverse(all(s));

    if (s[0]=='1'){
        cout << 1 << endl;
        return 0;
    }/*}}}*/

    vl tmp;
    s += '$';
    dump(s);
    int turn = 0;
    int osize = -1;
    rep(i, n+1){
        if (i>0 && s[i] != s[i-1]){
            // new
            if (turn==0){
                tmp = hakidasi(tmp);
                osize = sz(tmp);
            }
            else{
                dump(osize);
                tmp = hakidasi(tmp);
                dump(tmp);
                if (sz(tmp)!=osize){
                    cout << 1 << endl;
                    return 0;
                }
            }
            if (i<n) tmp.pb(a[i]);
            turn ^= 1;
        }
        else{
            tmp.pb(a[i]);
        }
    }
    cout << 0 << endl;
    return 0;
}


signed main(){/*{{{*/
    ll Q;cin>>Q;
    rep(_, Q){
        query();
    }
    check_input();
    return 0;
}/*}}}*/


Measured memory_bytes: 3664