Radio 106 FM

You are given a list of songs that played on Radio 106 FM. The list contains a total of $n$ songs. Find the length of the longest fragment of the list that consists of non-repeating songs.

Input

The first line contains the number of songs $n(1\le n\le 10^5)$ in the list. The second line contains $n$ integers $k_1,k_2,...,k_n(1\le k_i\le 10^9)$, which are the identification numbers of the songs.

Output

Print the length of the longest fragment of the list that consists of unique songs.

Examples