#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll INF = 10000000023LL;

ll op1(ll a, ll b){
    return max(a, b);
}

ll e1(){
    return -INF;
}

ll op2(ll a, ll b){
    return min(a, b);
}

ll e2(){
    return INF;
}

ll target;

bool f(ll x){
    return x <= target;
}

bool g(ll x){
    return x >= target;
}

int main() {
    ll T;
    cin >> T;
    while (T--){
        ll N;
        cin >> N;
        vector<ll> P(N);
        vector<ll> Q(N);
        rep(i, N){
            cin >> P[i];
            P[i]--;
        }
        rep(i, N){
            cin >> Q[i];
            Q[i]--;
        }

        segtree<ll, op1, e1> seg_max_p(N);
        segtree<ll, op2, e2> seg_min_p(N);
        segtree<ll, op1, e1> seg_max_q(N);
        segtree<ll, op2, e2> seg_min_q(N);
        rep(i, N){
            seg_max_p.set(i, P[i]);
            seg_min_p.set(i, P[i]);
            seg_max_q.set(i, Q[i]);
            seg_min_q.set(i, Q[i]);
        }

        // ともに index 最小のところに遷移するべき？
        ll INF = 10000000000023LL;
        vector<vector<ll>> dp(N, vector<ll>(N, 1));
        for (ll i = 0; i < N; i++){
            for (ll j = 0; j < N; j++){
                // 大, 大
                target = P[i];
                ll pr = seg_max_p.max_right<f>(i);
                target = Q[j];
                ll qr = seg_max_q.max_right<f>(j);
                if (pr < N && qr < N){
                    dp[pr][qr] = max(dp[pr][qr], dp[i][j] + 1);
                }

                // 小, 小
                target = P[i];
                pr = seg_min_p.max_right<g>(i);
                target = Q[j];
                qr = seg_min_q.max_right<g>(j);
                if (pr < N && qr < N){
                    dp[pr][qr] = max(dp[pr][qr], dp[i][j] + 1);
                }
            }
        }
        ll ans = 0;
        rep(i, N) rep(j, N) ans = max(ans, dp[i][j]);
        cout << ans << endl;
    }
}