#include<bits/stdc++.h>
#define LL long long

using namespace std;

const int maxn = 100005;
char arr1[maxn],arr2[maxn],use1[maxn],use2[maxn];
LL n,t,c1[3],c2[3],f[maxn],gong;
bool vis[maxn];
struct p{
	LL qian;
	LL hou;
}num[maxn];

bool cmp(p a,p b){
	return a.qian < b.qian;
}

int main(){
	freopen("edit.in" , "r" , stdin);
	freopen("edit.out" , "w" , stdout);
	cin >> t;
	while(t--){
		cin >> n;
		for(LL i = 1;i <= n;i++){
			cin >> arr1[i];
		}
		for(LL i = 1;i <= n;i++){
			cin >> arr2[i];
		}
		for(LL i = 1;i <= n;i++){
			cin >> use1[i];
			if(use1[i] == '1'){
				if(arr1[i] == '0'){
					c1[0]++;
				}
				else{
					c1[1]++;
				}
			}
		}
		for(LL i = 1;i <= n;i++){
			cin >> use2[i];
			if(use2[i] == '1'){
				if(arr2[i] == '0'){
					c2[0]++;
				}
				else{
					c2[1]++;
				}
			}
		}
		for(LL i = 1;i <= n;i++){
			if(use1[i] == '0' && use2[i] == '1'){
				c1[arr2[i] - '0']--;
			}
			if(use1[i] == '1' && use2[i] == '0'){
				c2[arr1[i] - '0']--;
			}
		}
		f[1] = 1;
		gong = min(c1[0] , c2[0]) + min(c1[1] , c2[1]);
		for(LL i = 1;i <= n;i++){
			if(use1[i] == '0' && use2[i] == '0' && arr1[i] != arr2[i]){
				vis[i] = 1;
			}
			if(use1[i] == '0' || use2[i] == '0'){
				f[i] = 0;
				num[i].qian = f[i - 1];
				num[i - f[i - 1]].hou = f[i - 1];
			}
			else{
				f[i] = f[i - 1] + 1;
			}
		}
		sort(num + 1, num + 1 + n,cmp);
		for(LL i = 1;i <= n;i++){
			if(num[i].qian <= gong){
				cout << gong + 2;
			}
			else{
				cout << gong;
			}
		}
	}
}