Similar Subsequence

Chef is given an array $A$ of length $N$. He considers a subarray $[L, R]$ to be *good* if and only if there exists a subsequence $[i_1, i_2, \ldots, i_{R-L+1} ]$ such that: - $A_{i_k} = A_{L+k-1}$ for each $1 \leq k \leq R-L+1$ (i.e. the subsequence is same as the subarray element-wise) - For **at least one** value of $k$, $i_k \neq L+k-1$ (i.e. the subsequence differs from the subarray index-wi