def main():
    n = int(input())
    P = list(map(lambda x: int(x)-1, input().split()))
    Q = list(map(lambda x: int(x)-1, input().split()))
    x0 = 0
    x1 = 0
    for i in range(n-1):
        if P[i] < P[i+1]:
            x0 ^= 1<<i
        else:
            x1 ^= 1<<i
    ans = 0
    for s in range(n):
        ss = 1<<s
        dp = [ss] * n
        for i in range(n):
            for j in range(i+1, n):
                if Q[i] < Q[j]:
                    dp[j] |= (dp[i] & x0) << 1
                else:
                    dp[j] |= (dp[i] & x1) << 1
        rep = 0
        for i in range(n):
            rep = max(rep, dp[i].bit_length())
        ans = max(ans, rep-s)
    return ans

for _ in range(int(input())):
    print(main())