Disjoint Non-Decreasing Array

You are given an array $A$ of length $N$. You can do the following operation **at most** once: - Select any non-empty subsequence such that no two consecutive elements are chosen; - Add any **positive** integer $X$ to all the chosen elements. Find whether you can make the array **non-decreasing** by doing **at most one** such operation. ### Input - The first line of input will contain a single i