Palindrome In Making

JJ has an array $A$ of length $N$. He can perform the following operation on $A$: - Select any $L$, $R$ ($1 \le L \le R \le N$) and for each $i$ such that $L \le i \le R$, set $A_i := A_i + 1$. JJ wants to make $A$ palindromic. Find the **minimum** number of moves to do so. Note: An array is called a palindrome if it reads the same backwards and forwards, for e.g. $[1, 3, 3, 1]$ and $[6, 2, 6]$