You are given a permutation(^{\text{∗}}) (p) of size (n). You may perform the following operation any number of times: Choose a subarray(^{\text{†}}) of size (3). Then, delete either the smallest or largest element within it. For example, for the permutation (2,4,5,3,1), you may choose the subarray (\mathbf{2},\mathbf{4},\mathbf{5},3,1). Since (5=\operatorname{max}(2,4,5)). you can delete (5) to obtain the array (2,4,3,1). You may also choose to delete (2) instead as (2=\operatorname{min}(2,4,5)). For each (i) from (1) to (n), find the minimum length of an obtainable array that contains the number (p_i). Note that this problem is to be solved independently for each (i). (^{\text{∗}})A permutation of length (n) is an array consisting of (n) distinct integers from (1) to (n) in arbitrary order. For example, (2,3,1,5,4) is a permutation, but (1,2,2) is not a permutation ((2) appears twice in the array), and (1,3,4) is also not a permutation ((n=3) but there is (4) in the array). (^{\text{†}})An array (a) is a subarray of an array (b) if (a) can be obtained from (b) by the deletion of several (possibly, zero or all) elements from the beginning and several (possibly, zero or all) elements from the end. Each test contains multiple test cases. The first line contains the number of test cases (t) ((1 \le t \le 500)). The description of the test cases follows. The first line of each test case contains a single integer (n) ((1 \le n \le 100)) — the length of the array. The second line of each test case contains (n) integers (p_1, p_2, \ldots, p_n) ((1 \le p_i \le n)). It is guaranteed that each element from (1) to (n) appears exactly once. For each test case, output (n) numbers on a new line: the answer for (i=1,2,\ldots,n). In the first example, we cannot perform any operations as