Array sorting

You are given an **unsorted** permutation $P$ of size $N$. An operation is defined as: - Swap $P_i$ and $P_{i+K}$ for any $i$ in the range $[1,N-K]$. Find the **maximum** value of $K$, such that, the permutation $P$ can be **sorted** by applying any finite number of operations. Note that, a permutation of size $N$ contains all integers from $1$ to $N$ **exactly** once. ### Input - The first li