Magic Palindrome

You are given an array $A$ of size $N$. You are allowed to perform the following operation on it any number of times: - Choose an index $i$ such that $1 \lt i \lt N$, and any integer $X$ ($X$ can be negative). - Then, modify the array as follows: - Subtract $X$ from $A_{i-1}$ (that is, $A_{i-1} \to A_{i-1} - X$) - Add $2X$ to $A_i$ (that is, $A_i \to A_i + 2X$) - Subtract $X$ from