Description

Input

The first line of the input contains one integer $n$ ($1 \le n \le 2 \cdot 10^5$) — the number of students.

The second line of the input contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^9$), where $a_i$ is a programming skill of the $i$-th student.

Output

Print one integer — the maximum possible number of students in a balanced team.

6
1 10 17 12 15 2

3

10
1337 1337 1337 1337 1337 1337 1337 1337 1337 1337

10

6
1 1000 10000 10 100 1000000000

1

Note

In the first example you can create a team with skills $[12, 17, 15]$.

In the second example you can take all students in a team because their programming skills are equal.

In the third example you can create a team consisting of a single student (and you cannot create a team consisting of at least two students).