#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll,ll> P;
const ll N = 2e5+5;
ll read(){
	char tmp = getchar();short st = 1;ll curr = 0;
	while('0'>tmp||'9'<tmp){
        if(tmp=='-')st = -1;
        tmp = getchar();
	}
	while(!('0'>tmp||'9'<tmp)){
        curr = curr*10 + tmp-'0';
        tmp = getchar();
	}
	return st*curr;
}
char s1[N],s2[N],t1[N],t2[N];
ll ans;
struct Seg{
	ll l,r,cnt0,cnt1;
}seg[3][N];
ll cnt[3];
void init(ll n){
	for(int i = 1;i <= n;i ++){
		seg[1][i].l = seg[1][i].cnt0 = seg[1][i].cnt1 = seg[2][i].l = seg[2][i].cnt0 = seg[2][i].cnt1 = 0;
	}
}
int main(){
	freopen("edit.in","r",stdin);
	freopen("edit.out","w",stdout);
	ll T = read();
	while(T--){
		ll n = read();
		scanf("%s%s%s%s",s1+1,s2+1,t1+1,t2+1);
		t1[0] = t2[0] = '0';
		t1[n+1] = t2[n+1] = '0';
		ans = 0;
		cnt[1] = cnt[2] = 1;
		init(n);
		for(int i = 1;i <= n+1;i ++){
			if(t1[i-1] == t1[i+1]&&t1[i-1] == '0')t1[i] = '0';
			if(t2[i-1] == t2[i+1]&&t2[i-1] == '0')t2[i] = '0';
			//if the elements beside i cannot move, i cannot move as well
			if(t1[i] == '1'&&seg[1][cnt[1]].l == 0)seg[1][cnt[1]].l = i;
			else if(t1[i] == '0'&&seg[1][cnt[1]].l != 0)seg[1][cnt[1]++].r = i-1;
			if(t2[i] == '1'&&seg[2][cnt[2]].l == 0)seg[2][cnt[2]].l = i;
			else if(t2[i] == '0'&&seg[2][cnt[2]].l != 0)seg[2][cnt[2]++].r = i-1;
			//seperates the segments that can move
			if(t1[i] == '1'&&s1[i]=='0')seg[1][cnt[1]].cnt0 ++;
			if(t1[i] == '1'&&s1[i]=='1')seg[1][cnt[1]].cnt1 ++;
			if(t2[i] == '1'&&s2[i]=='0')seg[2][cnt[2]].cnt0 ++;
			if(t2[i] == '1'&&s2[i]=='1')seg[2][cnt[2]].cnt1 ++;
			//see if si is 0 or 1
		}
//		printf("%s\n%s\n",t1+1,t2+1);
		ll idx1 = 1,idx2 = 1;
//		for(int i = 1;i <= cnt[1];i ++){
//			cout<<seg[1][i].l<<" "<<seg[1][i].r<<" "<<seg[1][i].cnt0<<" "<<seg[1][i].cnt1<<endl;
//		}
//		for(int i = 1;i <= cnt[2];i ++){
//			cout<<seg[2][i].l<<" "<<seg[2][i].r<<" "<<seg[2][i].cnt0<<" "<<seg[2][i].cnt1<<endl;
//		}
		for(int i = 1;i <= n;i ++){
			if(t1[i] == '1'&&seg[1][idx1].r < i)idx1++;
			if(t2[i] == '1'&&seg[2][idx2].r < i)idx2++;
			if(t1[i]=='0'&&t2[i]=='0'){
				ans += (s1[i]==s2[i]);
			}
			else if(t1[i] == '0'){
				if(s1[i] == '0'){
					if(seg[2][idx2].cnt0)seg[2][idx2].cnt0--,ans++;
					else seg[2][idx2].cnt1--;
				}else{
					if(seg[2][idx2].cnt1)seg[2][idx2].cnt1--,ans++;
					else seg[2][idx2].cnt0--;
				}
			}else if(t2[i] == '0'){
				if(s2[i] == '0'){
					if(seg[1][idx1].cnt0)seg[1][idx1].cnt0--,ans++;
					else seg[1][idx1].cnt1--;
				}else{
					if(seg[1][idx1].cnt1)seg[1][idx1].cnt1--,ans++;
					else seg[1][idx1].cnt0--;
				}
			}else{
				if(seg[1][idx1].cnt1&&seg[2][idx2].cnt1){
					seg[1][idx1].cnt1--;
					seg[2][idx2].cnt1--;
					ans ++;
				}else if(seg[1][idx1].cnt0&&seg[2][idx2].cnt0){
					seg[1][idx1].cnt0--;
					seg[2][idx2].cnt0--;
					ans ++;
				}else if(seg[1][idx1].cnt0){
					seg[1][idx1].cnt0--;
					seg[2][idx2].cnt1--;
				}else{
					seg[1][idx1].cnt1--;
					seg[2][idx2].cnt0--;
				}
			}
		}
		printf("%lld\n",ans);
	}
	return 0;
}
/*
2
10
0110111100
1111111100
1110000100
0110111011
9
101111111
100111000
110111011
011111111
*/