#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using pi = pair<int, int>;
using vpi = vector<pi>;
using vi = vector<int>;
using vll = vector<long long>;
using mpii = map<int, int>;
using mpll = map<ll, ll>;
using db = long double;

#define push_back pb
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define lb lower_bound
#define ub upper_bound

const int MOD = (int)1e9 + 7;
const db PI = acos((db)-1);
const int dx[4]{1, 0, -1, 0};
const int dy[4]{0, 1, 0, -1};

bool isSame(vi v1, vi v2) {
  for (int i = 0; i < v1.size(); i++) {
    if (v1[i] != v2[i]) {
      return false; 
    }
  }
  return true;
}

void solve() {
  int n;
  cin >> n;
  vi a(n);
  vi b(n);
  for (auto &x : a) cin >> x;
  for (auto &x : b) cin >> x;
  int za = 0;
  int zb = 0;
  for (int i = 0; i < n; i++) {
    za += a[i] == 0;
    zb += b[i] == 0;
  }
  int ans = 0;
}

int main () {
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	int tt;
	cin >> tt;
	while(tt--) {
    solve();
	}
}

/* stuff you should look for:
  ---------------------------
   * special cases (n=1?)
   * int overflow, array bounds
   * do smth instead of nothing and stay organized
   * WRITE STUFF DOWN
   * DON'T GET STUCK ON ONE APPROACH
 */