# MAP data structure

# Greedy Aziz

Do you know that Aziz loves chocolate sweets very much? However, his father does not allow him to eat a lot of chocolate because of his teeth.

Father gave him an array that contains a lot of identical numbers. During the day Aziz can eat as many candies as the maximum times the number in array is repeated.

Aziz wants to cheat to eat more candies. He can change some numbers in array, and the father will not notice it. He can increase or decrease any number in the array by **1** and only **1** time.

Aziz wants to eat the maximum number of sweets. Help him in this matter.

Find the maximum number of sweets Aziz can get.

#### Input

The first line contains the number of elements **n** (**1** ≤ **n** ≤ `10`

) in array. The second line contains ^{5}**n** elements `a`

(_{i}**0** ≤ `a`

≤ _{i}`10`

) of array.^{9}

#### Output

Print the maximum number of sweets Aziz can get.

2 1 2

2

4 1 3 3 5

3