Adjacent Pair Swaps

Chef has a **binary** array $A$ of length $N$. An operation on the array is defined as: - Choose two indices $i$ and $j$ such that $(1 \leq i,j \lt N)$ and $j \gt (i+1)$; - Swap $A_i$ with $A_j$; - Swap $A_{(i+1)}$ with $A_{(j+1)}$. Sort the array in **non-decreasing** order using **at most** $N$ operations or determine whether it is not possible to do so. It is guaranteed that if the array can