Wait! Perry Kahan Hai? 

Platypus Perry aka Agent P was on a mission when he got caught by Dr. Doofenshmirtz. While he is stuck, Dr. Doofenshmirtz explains to him his wicked plan of destroying the world. The Dr. has set up an advanced security system by setting up a password difficult to crack. Now, Perry needs to escape as soon as possible to ask Phineas and Ferb for help in punishing the (somewhat)Evil Scientist.

class="bias">Perry is stuck in a cage and needs to get out. There are n iron rods in his cell and each rod has an integer written on it denoted by $w_i$ of an array $w$ $(1 \leq i \leq n)$.

For each $1\leq i \leq n$ Perry has three choices:

• add $1$ to w_i
• subtract $1$  from w_i
• Do nothing

After this, he can select any integer $X$ and count the number of occurrences of $X$ in the newly formed sequence.

The maximum count of the number of occurrences of any integer $X$ in $w$ that Perry can achieve by making the optimal choices is the password that can lead him out of the cell. Help Perry Crack the password!

INPUT:

The first line of each input consists of an integer $n \ (1 \leq n \leq 10^5)$

The second line of each input consists of $n$ integers, $w_1, w_2, w_3, .., w_n$ $(1 \leq w_i \leq 10^5)$

OUTPUT: 

For each input, output the maximal occurrences of $X$ that you can achieve in the array by performing the above operations.