#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int tt;
  cin >> tt;
  while (tt--) {
    int n;
    cin >> n;
    VI p(n), q(n);
    rep(i, n) cin >> p[i], p[i]--;
    rep(i, n) cin >> q[i], q[i]--;
    VVI dp(n, VI(n));
    auto dfs = [&](auto&& self, int il, int ir) -> void {
      if (ir - il <= 1) return;
      int ic = (il + ir) / 2;
      self(self, il, ic);
      static VI js;
      js.clear();
      auto trans = [&](auto&& self, int jl, int jr) -> void {
        if (jr - jl <= 1) {
          if (jl < jr) js.emplace_back(jl);
          return;
        }
        int jc = (jl + jr) / 2;
        int sz1 = js.size();
        self(self, jl, jc);
        int sz2 = js.size();
        self(self, jc, jr);
        static VI tmp;
        tmp.assign(js.begin() + sz1, js.end());
        auto proj = [&](int j) { return q[j]; };
        ranges::merge(tmp.begin(), tmp.begin() + sz2 - sz1, tmp.begin() + sz2 - sz1, tmp.end(), js.begin() + sz1, {}, proj, proj);
        static segtree<int, [](int x, int y) { return max(x, y); }, []() { return -1; }> seg(1024);
        for (int j : js | views::drop(sz1)) {
          if (j < jc) {
            for (int i = il; i < ic; i++) seg.set(p[i], max(seg.get(p[i]), dp[i][j]));
          } else {
            for (int i = ic; i < ir; i++) chmax(dp[i][j], seg.prod(0, p[i]) + 1);
          }
        }
        for (int j : js | views::drop(sz1)) {
          if (j < jc) for (int i = il; i < ic; i++) seg.set(p[i], -1);
        }
        for (int j : js | views::drop(sz1) | views::reverse) {
          if (j < jc) {
            for (int i = il; i < ic; i++) seg.set(n-1-p[i], max(seg.get(n-1-p[i]), dp[i][j]));
          } else {
            for (int i = ic; i < ir; i++) chmax(dp[i][j], seg.prod(0, n-1-p[i]) + 1);
          }
        }
        for (int j : js | views::drop(sz1) | views::reverse) {
          if (j < jc) for (int i = il; i < ic; i++) seg.set(n-1-p[i], -1);
        }
      };
      trans(trans, 0, n);
      self(self, ic, ir);
    };
    dfs(dfs, 0, n);
    int ans = 0;
    rep(i, n) rep(j, n) chmax(ans, dp[i][j]);
    cout << ans + 1 << '\n';
  }
}