B'Mark is cleaning a row of n rooms. The i -th room has a nonnegative dust level a_i . He has a magical cleaning machine that can do the following three-step operation. The first line contains a single integer t ( 1 <= q t <= q 10^4 ) -- the number of test cases. The first line of each test case contains a single integer n ( 2 <= q n <= q 2 cdot 10^5 ) -- the number of rooms. The second line of each test case contains n integers a_1 , a_2 , ..., a_n ( 0 <= q a_i <= q 10^9 ) -- the dust level of each room. It is guaranteed that the sum of n across all test cases does not exceed 2 cdot 10^5 . For each test case, print a line containing a single integer -- the minimum number of operations. It can be proven that there is a sequence of operations that meets the goal. In the first case, one possible sequence of operations is as follows. In the second case, one possible sequence of operations is as follows. In the last case, the array already satisfies the condition. '...