This is the maximizing version of the problem. The difference between the versions is that in this version, you need to find the maximum possible depth among all common trees. Also, the constraint on (n) in this version is larger. You can hack only if you solved all versions of this problem. For Christmas, Tortinita and Arietta each get a Christmas tree. Coincidentally, their trees share the same properties: both have (n+1) vertices and are rooted at vertex (0). In their Christmas card to you, each of them appends a DFS order sequence of their tree after their greetings. Recall that a DFS order sequence is generated by the following pseudocode. Let the DFS order sequence of Tortinita's tree be (a_0, a_1, \ldots, a_n) and that of Arietta's tree be (b_0, b_1, \ldots, b_n). You observe that (a_0 = b_0 = 0), and since they are twin sisters, you wonder if they could have the exact same tree. You also feel that for their Christmas tree, the sisters would not choose a trivial structure. Therefore, you want to find the maximum possible depth(^{\text{∗}}) among all common trees for both sequences . (^{\text{∗}})The depth of a tree is defined as the maximum number of edges on a simple path from any node to the root. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 10^4)). The description of the test cases follows. The first line of each test case contains one integer (n) ((2 \le n \le 10^6)). The second line of each test case contains (n) integers (a_1, a_2, \cdots, a_n) ((1 \le a_i \le n)). The third line of each test case contains (n) integers (b_1, b_2, \cdots, b_n) ((1 \le b_i \le n)). It is guaranteed that neither sequence (a) nor (b) contains duplicates. It is guaranteed that the sum of (n) over all test cases does not exceed (10^6). For each test case, output one integer — the maximum possible depth among all common