#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;

struct node{
    int o, l;
};

int T;
int n, fa[N], fa2[N];
string s1, s2, t1, t2;
node k[N], k2[N];

void clean(){
    memset(fa, 0, sizeof(fa));
    memset(fa2, 0, sizeof(fa2));
    memset(k, 0, sizeof(k));
    memset(k2, 0, sizeof(k2));
}

int main()
{
    ios::sync_with_stdio(false), cin.tie(0);
    freopen("edit.in", "r", stdin);
    freopen("edit.out", "w", stdout);

    cin>>T;
    while(T--){
        clean();
        cin>>n>>s1>>s2>>t1>>t2;
        int cnt = 1;//init
        for(int i = 0; i < n; i ++){
            if(t1[i] == '0'){
                if(i > 0) cnt ++;
                fa[i] = cnt;
                if(s1[i] == '0') k[cnt].o ++;
                if(s1[i] == '1') k[cnt].l ++;
                if(i != n - 1) cnt ++;
            }
            else{
                fa[i] = cnt;
                if(s1[i] == '0') k[cnt].o ++;
                if(s1[i] == '1') k[cnt].l ++;
            }
        }
        cnt = 1;
        for(int i = 0; i < n; i ++){
            if(t2[i] == '0'){
                if(i > 0) cnt ++;
                fa2[i] = cnt;
                if(s2[i] == '0') k2[cnt].o ++;
                if(s2[i] == '1') k2[cnt].l ++;
                if(i != n - 1) cnt ++;
            }
            else{
                fa2[i] = cnt;
                if(s2[i] == '0') k2[cnt].o ++;
                if(s2[i] == '1') k2[cnt].l ++;
            }
        }//init
        int ans = 0;

        for(int i = 0; i < n; i ++){
            if(k[fa[i]].o > 0 && k2[fa2[i]].o > 0){
                k[fa[i]].o--;
                k2[fa2[i]].o--;
                ans++;
            }
            else if(k[fa[i]].l > 0 && k2[fa2[i]].l > 0){
                k[fa[i]].l--;
                k2[fa2[i]].l--;
                ans++;
            }
        }//line 55
        cout<<ans<<"\n";
    }

    return 0;
}