Swap to Increase

*This is the easy version of the problem. The only difference between this and the hard version are the constraints on $N$: here, $N \le 90$ and the sum of $N^4$ won't exceed $90^4$.* For a permutation$^\dagger$ $P$ of the integers $\{1, 2, \ldots, N\}$, we define $f(P)$ to be the length of the longest increasing subsequence of consecutive elements in $P$. Formally, $f(P)$ is defined to be the