#include<bits/stdc++.h>
using namespace std;
const int N=100005;
char a[N],b[N],c[N],d[N];
int sa[N],sb[N],righta[N],rightb[N];
int main()
{
	freopen("edit.in","r",stdin);
	freopen("edit.out","w",stdout);
	int i,t,n,ans,l,ra,rb,sa0,x,y,sb0,sa1,sb1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%s%s%s%s",&n,a+1,b+1,c+1,d+1);
		ans=l=ra=rb=0;
		for(i=1;i<=n;i++)
		{
			sa[i]=sa[i-1]+(a[i]=='1');
			sb[i]=sb[i-1]+(b[i]=='1');
			if(c[i]=='0')
			{
				righta[ra]=i;
				ra=i;
			}
			if(d[i]=='0')
			{
				rightb[rb]=i;
				rb=i;
			}
		}
		righta[ra]=n+1;
		rightb[rb]=n+1;
		ra=righta[0];
		rb=rightb[0];
		sa1=sa[ra-1];
		sb1=sb[rb-1];
		sa0=ra-1-sa1;
		sb0=rb-1-sb1;
		while(l<=n)
		{
			x=min(sa0,sb0);
			y=min(sa1,sb1);
			ans+=x+y;
			if(ra==rb)
			{
				l=ra;
				if(l>n)
					break;
				ans+=a[l]==b[l];
				ra=righta[ra];
				rb=rightb[rb];
				sa1=sa[ra-1]-sa[l];
				sb1=sb[rb-1]-sb[l];
				sa0=ra-1-l-sa1;
				sb0=rb-1-l-sb1;
			}
			else if(ra<rb)
			{
				sb0-=x;
				sb1-=y;
				sa0-=x;
				sa1-=y;
				l=ra;
				if(sb0==0)
					sb1-=sa0;
				else if(sb1==0)
					sb0-=sa1;
				if(a[l]=='1')
				{
					if(sb1)
					{
						sb1--;
						ans++;
					}
					else
						sb0--;
				}
				else if(a[l]=='0')
				{
					if(sb0)
					{
						sb0--;
						ans++;
					}
					else
						sb1--;
				}
				ra=righta[ra];
				sa1=sa[ra-1]-sa[l];
				sa0=ra-1-l-sa1;
			}
			else if(ra>rb)
			{
				sa0-=x;
				sa1-=y;
				sb0-=x;
				sb1-=y;
				if(sa0==0)
					sa1-=sb0;
				else if(sa1==0)
					sa0-=sb1;
				l=rb;
				if(b[l]=='1')
				{
					if(sa1)
					{
						sa1--;
						ans++;
					}
					else
						sa0--;
				}
				else if(b[l]=='0')
				{
					if(sa0)
					{
						sa0--;
						ans++;
					}
					else
						sa1--;
				}
				rb=rightb[rb];
				sb1=sb[rb-1]-sb[l];
				sb0=rb-1-l-sb1;
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}