#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

constexpr int Wmax = 64;
using BS = bitset<Wmax>;
std::vector<std::bitset<Wmax>> gauss_jordan(int W, std::vector<std::bitset<Wmax>> mtr)
{
    int H = mtr.size(), c = 0;
    for (int h = 0; h < H; h++, c++)
    {
        if (c == W) break;
        int piv = -1;
        for (int j = h; j < H; j++) if (mtr[j][c]) {
                piv = j; break;
        }
        if (piv == -1) { h--; continue; }
        std::swap(mtr[piv], mtr[h]);
        for (int hh = 0; hh < H; hh++) {
            if (hh != h and mtr[hh][c]) mtr[hh] ^= mtr[h];
        }
    }
    return mtr;
}

// Solve Ax = b on F_2
// - retval: {true, one of the solutions, {freedoms}} (if solution exists)
//           {false, {}, {}} (otherwise)
std::tuple<bool, std::bitset<Wmax>, std::vector<std::bitset<Wmax>>>
system_of_linear_equations(std::vector<std::bitset<Wmax>> A, std::bitset<Wmax> b, int W)
{
    int H = A.size();
    assert(W + 1 <= Wmax);
    assert(H <= Wmax);

    std::vector<std::bitset<Wmax>> M = A;
    for (int i = 0; i < H; i++) M[i][W] = b[i];
    M = gauss_jordan(W + 1, M);
    std::vector<int> ss(W, -1);
    for (int i = 0; i < H; i++)
    {
        int j = M[i]._Find_first();
        if (j == W)
        {
            return std::make_tuple(false, std::bitset<Wmax>(), std::vector<std::bitset<Wmax>>());
        }
        if (j < W) ss[j] = i;
    }
    std::bitset<Wmax> x;
    std::vector<std::bitset<Wmax>> D;
    for (int j = 0; j < W; j++)
    {
        if (ss[j] == -1)
        {
            std::bitset<Wmax> d;
            d[j] = 1;
            for (int jj = 0; jj < W; jj++) if (ss[jj] != -1) d[jj] = M[ss[jj]][j];
            D.emplace_back(d);
        }
        else x[j] = M[ss[j]][W];
    }
    return std::make_tuple(true, x, D);
}

int solve()
{
    int N;
    cin >> N;
    vector<lint> A(N);
    string S;
    cin >> A >> S;

    vector<lint> v;
    IREP(i, N)
    {
        if (S[i] == '0')
        {
            // dbg("0");
            // dbg(v);
            v.emplace_back(A[i]);
            vector<BS> mat;
            for (auto x : v)
            {
                mat.emplace_back(x);
            }
            mat = gauss_jordan(62, mat);
            v.clear();
            for (auto x : mat) if (x.count()) v.emplace_back(x.to_ullong());
            // dbg(v);
        }
        else
        {
            vector<BS> mat;
            // dbg(v);
            for (auto x : v)
            {
                mat.emplace_back(x);
            }
            vector<BS> matt(62);
            REP(i, mat.size()) REP(j, 62) matt[j][i] = mat[i][j];
            BS b = A[i];
            auto [rb, vec, tmp] = system_of_linear_equations(matt, b, mat.size());
            if (rb == false) return 1;
            // v.clear();
            // REP(i, mat.size()) if (vec[i] == 0 and mat[i].count()) v.emplace_back(mat[i].to_ullong());
        }
    }
    return 0;
}

int main()
{
    int T;
    cin >> T;
    while (T--) cout << solve() << '\n';
}


Measured memory_bytes: 3636