#include <cstdio>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <cctype>
#include <set>

namespace uvu
{
#define LOCAL ____________DONT_DEFINE_ME____________
#define ll long long
#define inf 0x3f3f3f3f
// #define int long long
// #define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return iS == iT ? EOF : *iS++;
#endif
#define getchar ERR
}

void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct Flusher { ~Flusher(){ Flush(); } }iamflusher;

void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
#define putchar ERR
}

template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}

template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x = -x;
	if(!x) sta[top = 1] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; ) putc(sta[top--] ^ 48);
	if(c) putc(c);
}

int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '#' || c == '?'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '#' || c == '?' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}

void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args>
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}

template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
// #define mod 998244353
// #define mod 1000000007
#define mod 29999999
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = sm(x + y); }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }

#define N 61
int n;
char s[N * 3];
bool sx[N], sy[N];
#define ui unsigned int
int f[N][N][N];
ui dp[2][N][N][2][2];

void solve()
{
	// memset(h, idx = -1, sizeof(h));
	// if(1.0 * clock() / CLOCKS_PER_SEC > 2.0) { print(-1, '\n'); return; }
    n = read(); //mp.clear();
    readstr(s, 0); for(int i = 0; i <= n; i++) sx[i] = (s[i] == '1');
    readstr(s, 0); for(int i = 0; i <= n; i++) sy[i] = (s[i] == '1');
    readstr(s, 1);
	if(n != 60) { print(-1, '\n'); return; }
	// for(int i = 1; i <= n + n + n; i++) s[i] = '?';
	for(int ac = 0; ac <= n; ac++) for(int ba = 0; ba <= n; ba++) for(int cb = 0; cb <= n; cb++)
	{
		f[ac][ba][cb] = 0;
		for(int i = ac; i + ba + cb <= n; i++) for(int j = ba; i + j + cb <= n; j++)
			if(sx[i] && sy[j]) f[ac][ba][cb] = 1;
	}
	ui ans = 0;
	for(int ac = 0; ac <= n; ac++) for(int ba = 0; ba <= n; ba++) if(f[ac][ba][0])
	{
		int lim = 0; for(int i = 1; i <= n; i++) if(f[ac][ba][i]) lim = i;
		memset(dp, 0, sizeof(dp));
		// for(int i = 0; i <= n; i++) for(int j = 0; j <= n; j++) for(int k = 0; k <= n; k++) dp[i][j][k][0][0] = dp[i][j][k][0][1] = dp[i][j][k][1][0] = dp[i][j][k][1][1] = 0;
		dp[0][0][0][!ac][!ba] = 1;
		// int tot = 0;
		bool op = 0;
		for(int p = 1; p <= n + n + n; p++)
		{
			op ^= 1;
			// for(int i = 0; i < p && i <= n; i++) for(int j = 0, k = p - 1 - i; j + i < p && j <= n; j++, k--) if(k <= n)
  			  for (int i = std::min(p - 1, n); i >= 0; i--) 
			{
      			int lb = std::max({0, p - i - 1 - n, (p - i - lim) >> 1}), rb = std::min({n, p - i - 1, ac - 2 * i + p - 1, i + ba});
      			for (int j = rb; j >= lb; j--) 
				{
        			int k = p - i - j - 1;
					{
						if((s[p] == 'A' || s[p] == '?') && i + 1 - k <= ac) for(int x = 0; x < 2; x++) for(int y = 0; y < 2; y++) dp[op][i + 1][j][x || (i + 1 - k == ac)][y] += dp[op ^ 1][i][j][x][y];
						if((s[p] == 'B' || s[p] == '?') && j + 1 - i <= ba) for(int x = 0; x < 2; x++) for(int y = 0; y < 2; y++) dp[op][i][j + 1][x][y || (j + 1 - i == ba)] += dp[op ^ 1][i][j][x][y];
						if((s[p] == 'C' || s[p] == '?') && k + 1 - j <= lim) for(int x = 0; x < 2; x++) for(int y = 0; y < 2; y++) dp[op][i][j][x][y] += dp[op ^ 1][i][j][x][y];
						for(int x = 0; x < 2; x++) for(int y = 0; y < 2; y++) dp[op ^ 1][i][j][x][y] = 0;
					}
				}
			}
		}
		// debug("+= %u\n", dp[op][n][n][1][1]);
		ans += dp[op][n][n][1][1];
		// debug("top = %d, this = %d\n", top, (n + 1) * (n + 1) * (n + 1) * 2 * 2);
	}
	print(ans, '\n');
}

void init()
{

}

char _ED_;

void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init(); int T = read(), Case = read();
	for(; T; solve(), T--);
}

#ifdef int
	#undef int
#endif
}

int main()
{
	uvu::mian(); return 0;
}