#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)

using namespace std;
using ll = long long;

void solve() {
    int n;
    cin >> n;
    
    vector<int> a(n), b(n);
    rep(i, n) cin >> a[i];
    rep(i, n) cin >> b[i];
    
    set<int> s1, s2;
    auto add = [&](int x) {
        auto it1 = s1.lower_bound(x);
        if (it1 == s1.end()) {
            s1.insert(x);
            return;
        }
        
        int y = *it1;
        
        s1.erase(it1);
        s1.insert(x);
        
        auto it2 = s2.lower_bound(y);
        if (it2 == s2.end()) {
            s2.insert(y);
            return;
        }
        
        s2.erase(it2);
        s2.insert(y);
    };
    
    rep(i, n) {
        auto [x, y] = minmax(a[i], b[i]);
        add(y);
        add(x);
    }
    
    int ans = s1.size()+s2.size();
    cout << ans << '\n';
}

int main() {
    int t;
    cin >> t;
    
    while (t--) solve();
    
    return 0;
}