B'AquaMoon has n friends. They stand in a row from left to right, and the i -th friend from the left wears a T-shirt with a number a_i written on it. Each friend has a direction (left or right). In the beginning, the direction of each friend is right. AquaMoon can make some operations on friends. On each operation, AquaMoon can choose two adjacent friends and swap their positions. After each operation, the direction of both chosen friends will also be flipped: left to right and vice versa. AquaMoon hopes that after some operations, the numbers written on the T-shirt of n friends in the row, read from left to right, become non-decreasing. Also she wants, that all friends will have a direction of right at the end. Please find if it is possible. The input consists of multiple test cases. The first line contains a single integer t ( 1 <= q t <= q 50 ) -- the number of test cases. The first line of each test case contains a single integer n ( 1 <= q n <= q 10^5 ) -- the number of Aquamoon 's friends. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= q a_i <= q 10^5 ) -- the numbers, written on the T-shirts. It is guaranteed that the sum of n for all test cases does not exceed 10^5 . For each test case, if there exists a possible sequence of operations, print "YES" (without quotes); otherwise, print "NO" (without quotes). You can print each letter in any case (upper or lower). The possible list of operations in the first test case: '...