#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define inl inline
#define push_back emplace_back
#define pii pair<int,int>
#define endl '\n'
const int N=1e6+5;
int t,n,m,s1[N],s2[N],a1[N],a2[N],idx1[N],idx2[N],val[N][2];
int p;
inl void solve(){
    cin>>n;
    for(int i=1;i<=n;i++){
        char c;cin>>c;
        s1[i]=c-'0';
    }
    for(int i=1;i<=n;i++){
        char c;cin>>c;
        s2[i]=c-'0';
    }
    for(int i=1;i<=n;i++){
        char c;cin>>c;
        a1[i]=c-'0';
    }
    for(int i=1;i<=n;i++){
        char c;cin>>c;
        a2[i]=c-'0';
    }
    for(int i=1;i<=n*2+2;i++)val[i][0]=val[i][1]=0;
    int ans=0,cc=0;
    for(int l=0,r=1;l<=n;l=r,r=l+1){
        while(r<=n&&a1[r])r++;
        ++cc;
        for(int i=l+1;i<r;i++)idx1[i]=cc,val[cc][s1[i]]++;
    }
    for(int l=0,r=1;l<=n;l=r,r=l+1){
        while(r<=n&&a2[r])r++;
        ++cc;
        for(int i=l+1;i<r;i++)idx2[i]=cc,val[cc][s2[i]]++;
    }
    for(int l=0,r=1,id=1;l<=n;l=r,r=l+1){
        while(r<=n&&a1[r]&&a2[r])r++;
        if(l){
            if(!a1[l]&&!a2[l])ans+=(s1[l]==s2[l]);
            else if(a1[l]){
                ans+=min(val[idx1[l]][s2[l]],1ll);
                val[idx1[l]][s2[l]]-=min(val[idx1[l]][s2[l]],1ll);
            }else{
                ans+=min(val[idx2[l]][s1[l]],1ll);
                val[idx2[l]][s1[l]]-=min(val[idx2[l]][s1[l]],1ll);
            }
        }
        if(l==r-1)continue;
        int k1=min(val[idx1[l+1]][0],min(val[idx2[l+1]][0],r-l-1));
        int k2=min(val[idx1[l+1]][1],min(val[idx2[l+1]][1],r-l-1));
        ans+=k1;val[idx1[l+1]][0]-=k1;val[idx2[l+1]][0]-=k1;
        ans+=k2;val[idx1[l+1]][1]-=k2;val[idx2[l+1]][1]-=k2;
    }
    cout<<ans<<endl;
}
signed main(){
    freopen("edit.in","r",stdin);
    freopen("edit.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    t=1;
    cin>>t;
    while(t--)solve();
    return 0;
}