#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************




vector<int> a;
vector<int> b;

int consistency(int n){

    vector<int> a_pos, a_neg;
    for(int i=0; i<n; i++){
        if(a[i] >= 0) a_pos.push_back(abs(a[i]));
        else a_neg.push_back(abs(a[i]));
    }

    vector<int> b_pos, b_neg;
    for(int i=0; i<n; i++){
        if(b[i] >= 0) b_pos.push_back(abs(b[i]));
        else b_neg.push_back(abs(b[i]));
    }

    sort(begin(a_pos), end(a_pos));
    sort(begin(a_neg), end(a_neg));

    sort(begin(b_pos), end(b_pos));
    sort(begin(b_neg), end(b_neg));


    int ct1 = 0;
    int i = 0, j = 0;
    while(i<a_pos.size() && j<b_neg.size()){
        if(a_pos[i] < b_neg[j]){
            ct1++;
            i++;
            j++;
        }
        else j++;
    }


    int ct2 = 0;
    i = 0, j = 0;
    while(i<b_pos.size() && j<a_neg.size()){
        if(b_pos[i] < a_neg[j]){
            ct2++;
            i++;
            j++;
        }
        else j++;
    }

    return ct1+ct2;
}















int practice(int n){


    return 0;
}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    b.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    for(int i=0; i<n; i++) cin >> b[i];
    
    cout << consistency(n) << endl;


}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}