B'Call an array a of length n sorted if a_1 <= q a_2 <= q ldots <= q a_{n-1} <= q a_n . Ntarsis has an array a of length n . He is allowed to perform one type of operation on it (zero or more times): The values of a can be negative after an operation. Determine the minimum operations needed to make a not sorted. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 100 ). The description of the test cases follows. The first line of each test case contains a single integer n ( 2 <= q n <= q 500 ) -- the length of the array a . The next line contains n integers a_1, a_2, ldots, a_n ( 1 <= q a_i <= q 10^9 ) -- the values of array a . It is guaranteed that the sum of n across all test cases does not exceed 500 . Output the minimum number of operations needed to make the array not sorted. In the first case, we can perform 1 operation to make the array not sorted: In the second case, we can perform 2 operations to make the array not sorted: It can be proven that 1 and 2 operations are the minimal numbers of operations in the first and second test cases, respectively. In the third case, the array is already not sorted, so we perform 0 operations. '...