from sys import stdin
input = stdin.readline
from bisect import bisect_left, bisect_right

for _ in range(int(input())):
    N = int(input())
    A = list(map(int, input().split()))
    B = list(map(int, input().split()))

    C = []
    for i in range(N):
        C.append(max(A[i], B[i]))
        C.append(min(A[i], B[i]))

    stack = []
    stack2 = []
    for c in C:
        b = bisect_left(stack, c)
        if b < len(stack):
            n = stack[b]
            stack[b] = c
            b = bisect_left(stack2, n)
            if b < len(stack2):
                stack2[b] = n
            else:
                stack2.append(n)
        else:
            stack.append(c)

    print(len(stack)+len(stack2))