#include <bits/stdc++.h>
#include <sys/types.h>
#include <unistd.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
using R=long double;
const R EPS=1e-9L; // [-1000,1000]->EPS=1e-8 [-10000,10000]->EPS=1e-7
inline int sgn(const R& r){return(r > EPS)-(r < -EPS);}
inline R sq(R x){return sqrt(max(x,0.0L));}

template<typename T> vector<T> make_vector(size_t sz){
	return vector<T>(sz);
}

template<typename T,typename... Ts> 
auto make_vector(size_t sz, Ts... ts){
	return vector<decltype(make_vector<T>(ts...))>(sz, make_vector<T>(ts...));
}

template<typename T,typename U,typename... V> 
typename enable_if<is_same<T, U>::value!=0>::type 
fill_value(U &u, const V... v){
	u=U(v...);
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_value(U &u, const V... v){
	for(auto &e:u){
		fill_value<T>(e,v...);
	}
}

const int dx[8]={1,0,-1,0,1,-1,-1,1};
const int dy[8]={0,1,0,-1,1,1,-1,-1};

const pid_t pid = getpid();

bool normalize(vector<ll> &basis, ll val) {
	const int n = basis.size();
	const int m = 60;

	rep(i, n) {
		ll cmax = basis[i], pos = i;
		rep(j, i + 1, n) if(chmax(cmax, basis[j])) pos = j;
		if(cmax == 0) break;
		swap(basis[i], basis[pos]);
		
		int col = m - 1;
		while(col >= 0 and (((basis[i] >> col) & 1) == 0)) col--;

		rep(j, i + 1, n) {
			if((basis[j] >> col) & 1) {
				basis[j] ^= basis[i];
			}
		}
		
		if((val >> col) & 1) {
			val ^= basis[i];
		}
	}

	return (val == 0LL);
}

int main(void){
	int t;
	cin >> t;
	rep(loop, t) {
		int n;
		cin >> n;

		vector<ll> a(n);
		rep(i, n) cin >> a[i];
		string s;
		cin >> s;
		
		int ans = 0;
		vector<ll> zero;

		rrep(i, n) {
			if(s[i] == '1') {
				if(normalize(zero, a[i]) == false) {
					ans = 1;
				}
			} else {
				zero.push_back(a[i]);
			}
		}
				
		cout << ans << endl;
	}
	return 0;
}