// 参考
//   xorの掃き出し https://twitter.com/noshi91/status/1200702280128856064
//   https://atcoder.jp/contests/agc045/submissions/14100178
//   https://atcoder.jp/contests/agc045/submissions/14091582

#include <iostream>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
#define REP(i,n) for(int i = 0; i < (int)(n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (int)(b); ++i)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(v) ((int)v.size())
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b; return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b; return true;
    }
    return false;
}
template<int MOD> struct Fp {
    ll val;
    constexpr Fp(ll v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        ll a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            ll t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, ll n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
constexpr ll MOD = 1e9 + 7;
using mint = Fp<MOD>;

#define pb push_back
#define mp make_pair
#define mt make_tuple


int solve(int N, vector<ll> As, string S) {

    // set<ll, greater<ll>> bases;
    vector<ll> bases;

    for(int i = N - 1; i >= 0; --i) {
        ll a = As[i];
        if (S[i] == '0') {
            for (auto b: bases) chmin(a, a ^ b);
            if (a) {
                // bases.insert(a);
                bases.pb(a);
            }
        }
        else {
            for (auto b: bases) chmin(a, a ^ b);
            if (a) {
                return 1;
            }
        }
        // cout << "bases:" << endl;
        // for(auto b: bases) cout << "  " << b << endl;
    }
    return 0;
}


int main(void)
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int T; cin >> T;
    REP(t, T) {
        int N; cin >> N;
        vector<ll> As(N);
        REP(n, N) cin >> As[n];
        string S; cin >> S;

        cout << solve(N, As, S) << endl;
    }
    return 0;
}


Measured memory_bytes: 3532