import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

long mod = 10^^9 + 7;
//long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { y.modpow(mod - 2); x.modm(y); }

T binarySearch(alias pred, T)(T ok, T ng)
{ 
	while (abs(ok-ng) > 1)
	{
		auto mid = (ok+ng)/2;
		if (unaryFun!pred(mid)) ok = mid;
		else ng = mid;
	}
	return ok;
}

void main()
{
	auto T = RD;
	auto ans = new long[](T);
	foreach (ti; 0..T)
	{
		auto N = RD;
		auto A = RDA;
		auto S = RD!string;

		auto list = new long[][](64);
		foreach (i; 0..N)
		{
			if (S[i] == '1') continue;
			foreach (j; 0..64)
			{
				auto bit = 1L << j;
				if (A[i] & bit)
				{
					list[j] ~= i;
				}
			}
		}

		int[long] memo;
		bool test(long i, long x, bool[] used)
		{
			if (x == 0) return true;
			//auto m = memo.get(i, -1);
			//if (m != -1) return m == 0;
			foreach (j; 0..64)
			{
				auto bit = 1L << j;
				if (x & bit)
				{
					/*bool f(long k)
					{
						return list[i][k] <= i;
					}
					auto r = binarySearch!(f)(-1L, cast(long)list[i].length) + 1;*/
					foreach (k; 0..list[j].length)
					{
						auto pos = list[j][k];
						if (used[pos]) continue;
						used[pos] = true;
						if (test(pos, x ^ A[pos], used))
							return true;
						used[pos] = false;
					}
				}
			}
			//memo[i] = 1;
			return false;
		}

		bool ok = true;
		auto used = new bool[](N);
		bool[long] set;
		foreach (i; 0..N)
		{
			used[i] = true;
			if (S[i] == '0') continue;
			if (set.get(A[i], false)) continue;
			//memo.clear;
			auto r = test(i, A[i], used.dup);
			set[A[i]] = true;
			if (!r)
			{
				debug writeln("i:", i, " A[i]:", A[i]);
				ok = false;
				break;
			}
		}
		ans[ti] = ok ? 0 : 1;
	}

	foreach (e; ans)
		writeln(e);
	stdout.flush;
	debug readln;
}
