Increase 2 consecutive characters

Chef has $2$ strings $A$ and $B$ of equal length $N$. Both strings contain lowercase english alphabets only. Chef can perform several moves on string $A$. In one move, Chef has to: - Select an index $i \space (1 \leq i \leq N-1)$. - Replace $A[i]$ with $(A[i]+1)$. - Replace $A[i+1]$ with $(A[i+1]+1)$. For example, if $A = \texttt{abcze}$, a valid move would be to select index $3$. This way the s