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

using namespace std;

const int MOD = 1e9 + 7;

void solve(){
	int n;
	cin >> n;
	
	int a = 0, b = 0;
	
	int cnt1 = 0, cnt2 = 0;
	
	vector<int> arr(n);
	
	for(int i = 0; i < n; i++){
		cin >> arr[i];
	}
	
	for(int i = 0; i < n; i++){
		int x;
		cin >> x;
		if(x == 1 && arr[i] == 1)cnt1++;
		else if(x == -1 && arr[i] == -1)cnt2++;
		else{
			if(x == 0 && arr[i] == 1)a++;
			else if(x == 1 && arr[i] == 0)b++;
			else if(x == 1 && arr[i] == -1)b++;
			else if(x == -1 && arr[i] == 1)a++;
		}
	}
	
	while(cnt1--){
		if(a > b)b++;
		else a++;
	}
	
	while(cnt2--){
		if(a > b)a--;
		else b--;
	}
	cout << min(a, b) << "\n";
	
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t = 1;
	cin >> t;
	
	for(int i = 1; i <= t; i++){
		solve();
	}
	return 0;
}