Summit (Easy)

**This is the easy version of the problem. The only difference between this and the hard version is the constraint on $N$: here, the sum of $N$ across all tests won't exceed $2000$.** You are given a permutation$^\dagger$ $P$ of the integers $1$ to $N$. **At most once**, you can do the following operation: - Choose two indices $i$ and $j$ ($1 \leq i \lt j \leq N$) and swap $P_i$ and $P_j$. F