Parity Sort

You are given an integer sequence $A$ of length $N$.

You may perform the following operation any number of times.

Choose two distinct indices $i,j$ and swap $A_i$ and $A_j$. However, $i$ and $j$ must have the same parity. In other words, they must be both odd indices or both even indices.

The indices of the sequence are $1$-based. Determine whether it is possible to sort the sequence in nondecreasing order using only the allowed operations.

The input is given in the following format.

$N$ $A_1\ A_2\ \cdots\ A_N$

Print YES if the sequence can be sorted in nondecreasing order using only the allowed operations. Otherwise, print NO.

• $1 \le N \le 200\,000$.
• $1 \le A_i \le 10^9$ ($1 \le i \le N$).