A12802 | Uniqueness

You are given an array $a_{1}, a_{2}, \ldots, a_{n}$ . You can remove at most one subsegment from it. The remaining elements should be pairwise distinct.

In other words, at most one time you can choose two integers $l$ and $r$ ( $1 \leq l \leq r \leq n$ ) and delete integers $a_l, a_{l+1}, \ldots, a_r$ from the array. Remaining elements should be pairwise distinct.

Find the minimum size of the subsegment you need to remove to make all remaining elements distinct.

The first line of the input contains a single integer $n$ ( $1 \le n \le 2000$ ) — the number of elements in the given array.

The next line contains $n$ spaced integers $a_{1}, a_{2}, \ldots, a_{n}$ ( $1 \le a_{i} \le 10^{9}$ ) — the elements of the array.

Print a single integer — the minimum size of the subsegment you need to remove to make all elements of the array pairwise distinct. If no subsegment needs to be removed, print $0$ .