Crazy Permutations

Chef has two permutations $A$ and $B$ of length $N$. Here, a permutation of length $N$ is an array containing each integer from $1$ to $N$ exactly once. Chef wants to transform array $A$ into array $B$ using the following operation any number of times (possibly zero): - Choose an index $k$ ($1 \le k \le N$) and either increase $A_k$ by $1$ or decrease $A_k$ by $1$. However, after every operation