B'Tenzing has n balls arranged in a line. The color of the i -th ball from the left is a_i . Tenzing can do the following operation any number of times: Tenzing wants to know the maximum number of balls he can remove. Each test contains multiple test cases. The first line of input contains a single integer t ( 1 <= q t <= q 10^3 ) -- the number of test cases. The description of test cases follows. The first line contains a single integer n ( 1 <= q n <= q 2 cdot 10^5 ) -- the number of balls. The second line contains n integers a_1,a_2, ldots,a_n ( 1 <= q a_i <= q n ) -- the color of the balls. It is guaranteed that sum of n of all test cases will not exceed 2 cdot 10^5 . For each test case, output the maximum number of balls Tenzing can remove. In the first example, Tenzing will choose i=2 and j=3 in the first operation so that a=[1,3,3] . Then Tenzing will choose i=2 and j=3 again in the second operation so that a=[1] . So Tenzing can remove 4 balls in total. In the second example, Tenzing will choose i=1 and j=3 in the first and only operation so that a=[2] . So Tenzing can remove 3 balls in total. '...