Rotate Odd

You are given an array of size $N$. You can perform the following operation on it any number of times. - Choose an **odd** integer $K$ such that $1 \leq K \leq N$. - Choose an index $i$ such that $1 \leq i \leq N-K+1$. - Reverse the subarray from index $i$ to $i+K-1$. You are given two arrays $A$ and $B$. Is it possible to make $A[i] = B[i]$ for all $1 \leq i \leq N$ by applying the given operat