#include <bits/stdc++.h>
using namespace std;

int T, n, ans, ca[2], cb[2];
string s, t, a, b;

int main() {
	freopen("edit.in", "r", stdin);
	freopen("edit.out", "w", stdout);
	ios::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);
	cin >> T;
	while (T--) {
		cin >> n >> s >> t >> a >> b;
		s = ' ' + s + ' ';
		t = ' ' + t + ' ';
		a = ' ' + a + ' ';
		b = ' ' + b + ' ';
		ans = ca[0] = ca[1] = cb[0] = cb[1] = 0;
		for (int i = 1, p = 0, q = 0; i <= n; ++i) {
			if (a[i] == '0') ca[s[p = i] - '0'] = 1, ca[(s[p] - '0') ^ 1] = 0;
			else while (a[p + 1] == '1') ++ca[s[++p] - '0'];
			if (b[i] == '0') cb[t[q = i] - '0'] = 1, cb[(t[q] - '0') ^ 1] = 0;
			else while (b[q + 1] == '1') ++cb[t[++q] - '0'];
//			cout << i << ' ' << p << ' ' << q << ' ' << '\n';
//			cout << ca[0] << ' ' << ca[1] << '\n';
//			cout << cb[0] << ' ' << cb[1] << '\n';
			if (p < q) {
				ans += min(min(ca[0], cb[0]) + min(ca[1], cb[1]), p - i + 1);
				cb[0] -= ca[0], cb[1] -= ca[1], ca[0] = ca[1] = 0;
				if (cb[0] < 0) cb[1] += cb[0], cb[0] = 0;
				if (cb[1] < 0) cb[0] += cb[1], cb[1] = 0;
			} else {
				ans += min(min(ca[0], cb[0]) + min(ca[1], cb[1]), q - i + 1);
				ca[0] -= cb[0], ca[1] -= cb[1], cb[0] = cb[1] = 0;
				if (ca[0] < 0) ca[1] += ca[0], ca[0] = 0;
				if (ca[1] < 0) ca[0] += ca[1], ca[1] = 0;
			}
			i = min(p, q);
//			cout << ans << '\n';
		}
		cout << ans << '\n';
	}
	return 0;
}/*
011101
111010
111010
101101


1100111100
1111111100

1110000100
0110111011

101111111
100111000

110111011
011111111
*/