Range Assign, Number of Distinct Elements Minimize

You are given an array $A$ of $N$ **positive** integers. In one operation, you can do the following: - Choose integers $i$ and $j$ $(1 \le i < j \le N)$, such that $A_i = A_j$; - For all $k$ $(i < k < j)$, change the value of $A_k$ to $A_i$. Find out whether $A$ can have **at most $2$ distinct** values after using **any** (possibly zero) number of operations. ### Input - The first line of inpu