Balanced Positions in a Permutation

You are given a [permutation](https://en.wikipedia.org/wiki/Permutation) $P$ of length $N$, i.e. an array containing each integer from $1$ to $N$ exactly once. For each position $i$ ($1 \leq i \leq N$), define: - $L_i$ = the number of elements **smaller** than $P_i$ that appear to its **left**. - $R_i$ = the number of elements **greater** than $P_i$ that appear to its **right**. Your task is to