You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

Description

Different snowflakes often have different shapes. A student in the north wants to collect snowflakes as gifts for friends in the south. There are $n$ moments in total, and the shape of the snowflake falling at each moment is given, represented by distinct integers. During the collection process, the students do not want duplicate snowflakes. You can start collecting at any moment $a$ and stop at moment $b$. All snowflakes falling between moments $a$ and $b$ will be collected. They wish to collect as many snowflakes as possible.

Input Format

The first line contains a positive integer $n$;

The second line contains $n$ non-negative integers representing the shapes of the snowflakes at each of the $n$ moments.

Output Format

The maximum number of snowflakes that can be collected.

Sample 1

5
1 2 3 2 1

3

Data Range and Hint

For 97 points of the data, $1\le n \le 10^6, 0\le x_i \le 10^8$. (This is the original data.)

As per user request, an additional 3 points of data are included: $1\le n\le 10^6,0\le x_i\le 10^9$.