Different Subarrays Rearrange

You are given an array $A$ of $N$ integers $A_1, A_2, \ldots, A_N$. Determine if there are two [permutations](https://en.wikipedia.org/wiki/Permutation) $B$ and $C$ of this array, for which the following condition is satisfied: * There doesn't exist a pair of integers $(i, j)$ such that $1 \le i \le j \le N$ and $(i, j) \neq (1, N)$, for which the subarray $B[i:j]$ is a permutation of subarray $C