B'You are given a permutation a_1, a_2, ldots, a_n of size n , where each integer from 1 to n appears exactly once. You can do the following operation any number of times (possibly, zero): Determine whether you can make the array a sorted in non-descending order. Each test consists of multiple test cases. The first line contains a single integer t ( 1 <= t <= 5000 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains a single integer n ( 3 <= n <= 10 ) -- the length of the array a . The second line contains n integers a_1,a_2, ... ,a_n ( 1 <= a_i <= n , a_i neq a_j if i neq j ) -- the elements of the array a . For each test case, output "Yes" (without quotes) if the array can be sorted in non-descending order, and "No" (without quotes) otherwise. You can output "Yes" and "No" in any case (for example, strings "YES", "yEs" and "yes" will be recognized as a positive response). In the first test case, [1,2,3] is already sorted in non-descending order. In the second test case, we can choose i = 1,j = 2,k = 3 . Since a_1 <= a_3 , swap a_2 and a_3 , the array then becomes [1,2,3] , which is sorted in non-descending order. In the seventh test case, we can do the following operations successively: In the third, the fourth, the fifth and the sixth test cases, it can be shown that the array cannot be sorted in non-descending order. '...