You are given an array (a) consisting of (n) integers. While the array is not empty, an operation is performed consisting of two steps: first, the maximum element in the array is chosen (if there are multiple maximum elements, the rightmost maximum is chosen); then, all elements after the chosen element, including it , are removed from the array. Your task is to calculate the number operations that will be performed before the array becomes empty. The first line contains one integer (t) ((1 \le t \le 10^4)) — the number of test cases. Each test case consists of two lines: the first line contains one integer (n) ((2 \le n \le 2 \cdot 10^5)); the second line contains (n) integers (a_1, a_2, \dots, a_n) ((1 \le a_i \le n)). Additional constraint on the input: the sum of (n) over all test cases does not exceed (2 \cdot 10^5). For each test case, print one integer — the number of operations that will be performed. In the first example, the array is (2, 1, 2, 3, 1). The following operations are performed on it: first, the (4)-th element is chosen. The last two elements are removed, and the array becomes (2, 1, 2); then, the (3)-rd element is chosen. The last element is removed, and the array becomes (2, 1); then, the (1)-st element is chosen. Both elements are removed, so the array becomes empty after (3) operations.