# Click Here!

Odd Swap Sort solution codeforces:- You are given an array a1,a2,,ana1,a2,…,an. You can perform operations on the array. In each operation you can choose an integer ii (1i<n1≤i<n), and swap elements aiai and ai+1ai+1 of the array, if ai+ai+1ai+ai+1 is odd.

Determine whether it can be sorted in non-decreasing order using this operation any number of times.

### Odd Swap Sort solution codeforces Input

Each test contains multiple test cases. The first line contains a single integer tt (1t1051≤t≤105) — the number of test cases. Description of the test cases follows.

The first line of each test case contains a single integer nn (1n1051≤n≤105) — the length of the array.

The second line of each test case contains nn integers a1,a2,,ana1,a2,…,an (1ai1091≤ai≤109) — the elements of the array.

It is guaranteed that the sum of nn over all test cases does not exceed 21052⋅105.

### Output Odd Swap Sort solution codeforces

For each test case, print “Yes” or “No” depending on whether you can or can not sort the given array.

You may print each letter in any case (for example, “YES”“Yes”“yes”“yEs” will all be recognized as positive answer).

### Odd Swap Sort solution codeforces

input

Copy
4
4
1 6 31 14
2
4 2
5
2 9 6 7 10
3
6 6 6


### Odd Swap Sort solution codeforces

Copy
Yes
No
No
Yes

Note

In the first test case, we can simply swap 3131 and 1414 (31+14=4531+14=45 which is odd) and obtain the non-decreasing array [1,6,14,31][1,6,14,31].

In the second test case, the only way we could sort the array is by swapping 44 and 22, but this is impossible, since their sum 4+2=64+2=6 is even.

In the third test case, there is no way to make the array non-decreasing.

In the fourth test case, the array is already non-decreasing.