Weird Subarrays

An array $A$ is called *weird* if it can be sorted in non-decreasing order by applying the given operation any number of times: - Select any index $i$ $(1 \le i \le |A|)$ and set $A_i := -A_i$. For example: $A = [2, 1, 3]$ is *weird* since after applying the operation at $i = 1$, $A$ becomes $[-2, 1, 3]$ which is sorted. JJ has a permutation $P$ of length $N$. He wants to find the number of suba