Array Halves

Chef has a permutation $P$ of length $2 \cdot N$. He can perform the following operation on $P$: - Select an index $i$ $(1 \le i \lt 2 \cdot N)$ and swap $P_i$ and $P_{i + 1}$. Chef would call the permutation $P$ *good*, if the **maximum** element of the first half of $P$ is **less** than the **minimum** element of the second half of $P$. Formally $\displaystyle \max_{(1 \le i \le N)} P_i \lt \