B"You are given an array a of length n . Let's define the eversion operation. Let x = a_n . Then array a is partitioned into two parts: left and right. The left part contains the elements of a that are not greater than x ( <= x ). The right part contains the elements of a that are strictly greater than x ( > x ). The order of elements in each part is kept the same as before the operation, i. e. the partition is stable. Then the array is replaced with the concatenation of the left and the right parts. For example, if the array a is [2, 4, 1, 5, 3] , the eversion goes like this: [2, 4, 1, 5, 3] to [2, 1, 3], [4, 5] to [2, 1, 3, 4, 5] . We start with the array a and perform eversions on this array. We can prove that after several eversions the array a stops changing. Output the minimum number k such that the array stops changing after k eversions. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 100 ). Description of the test cases follows. The first line contains a single integer n ( 1 <= n <= 2 cdot 10^5 ). The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^9 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case print a single integer k -- the number of eversions after which the array stops changing. Consider the fist example. Consider the second example. "...