#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <chrono>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T> ostream &operator<<(ostream &os, const vector<T> &as);
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


constexpr int INF = 1001001001;

int N;
vector<int> P, Q;

int f[1010][1010];
int up[1010][1010];
int dn[1010][1010];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%d", &N);
    P.resize(N); for (int i = 0; i < N; ++i) scanf("%d", &P[i]);
    Q.resize(N); for (int i = 0; i < N; ++i) scanf("%d", &Q[i]);
    
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) f[i][j] = 1;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) up[i][j] = -INF;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) dn[i][j] = -INF;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
      for (int ii = i + 1; ii < N; ++ii) {
        chmax((P[i] < P[ii]) ? up[ii][j] : dn[ii][j], f[i][j] + 1);
      }
      for (int jj = j + 1; jj < N; ++jj) {
        chmax(f[i][jj], (Q[j] < Q[jj]) ? up[i][j] : dn[i][j]);
      }
    }
    int ans = 0;
    for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) chmax(ans, f[i][j]);
    printf("%d\n", ans);
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}