Odd Adjacent Swap

Yash has a list of non-negative numbers. Sadly, the list is unsorted which makes him unhappy. Sorting the list normally would be trivial so Yash decided to impose some restrictions on the process. The list can only be sorted in the following way: (i) In each operation you can choose an integer i between 1 and n (ii) Swap elements at index i and i+1 only if sum of them is odd. This can be done a