B'Let 's call an array b_1, b_2, ldots, b_m a test if b_1 = m - 1 . Let 's call an array b_1, b_2, ldots, b_m a multitest if the array b_2, b_3, ldots, b_m can be split into b_1 non-empty subarrays so that each of these subarrays is a test. Note that each element of the array must be included in exactly one subarray, and the subarrays must consist of consecutive elements. Let 's define the function f from the array b_1, b_2, ldots, b_m as the minimum number of operations of the form "Replace any b_i with any non-negative integer x ", which needs to be done so that the array b_1, b_2, ldots, b_m becomes a multitest. You are given an array of positive integers a_1, a_2, ldots, a_n . For each i from 1 to n - 1 , find f([a_i, a_{i+1}, ldots, a_n]) . Below are some examples of tests and multitests. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 300 ,000 ). The description of the test cases follows. The first line of each test case contains a single integer n ( 2 <= n <= 300 ,000 ) -- the length of the array a . The second line of each test case contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 300 ,000 ) -- elements of the array a . It is guaranteed that the sum of n over all test cases does not exceed 300 ,000 . For each test case print n - 1 numbers -- f([a_i, a_{i+1}, ldots, a_n]) for each i from 1 to n - 1 . In the first test case of the first test the array [1, 2, 1, 7] is a multitest since the array [2, 1, 7] is a test. The array [2, 1, 7] is not a multitest, but after replacing the first number with 1 , an array [1, 1, 7] is obtained, which is a multitest. The array [1, 7] is also not a multitest, but the array [1, 0] is, so f([1, 7]) = 1 . In the second test case '...