Radio 106 FM#11340
You are given a list of songs that played on Radio 106 FM. The list contains a total of songs. Find the length of the longest fragment of the list that consists of non-repeating songs.
The first line contains the number of songs n~(1 \le n \le 10^5) in the list. The second line contains integers k_1, k_2, ..., k_n~(1 \le k_i \le 10^9), which are the identification numbers of the songs.
Print the length of the longest fragment of the list that consists of unique songs.
Example 1
Example 2