Problem: You are a coach at your local university. There are n students under your supervision, the programming skill of the i-th student is a_i.

You have to create a team for a new programming competition. As you know, the more students some team has the more probable its victory is! So you have to create a team with the maximum number of students. But you also know that a team should be balanced. It means that the programming skill of each pair of students in a created team should differ by no more than 5.

Your task is to report the maximum possible number of students in a balanced team.

Input

The first line of the input contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the number of students.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 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.

Examples

Input


6
1 10 17 12 15 2


Output


3


Input


10
1337 1337 1337 1337 1337 1337 1337 1337 1337 1337


Output


10


Input


6
1 1000 10000 10 100 1000000000


Output


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).

Solution (in PYTHON3):

Solution:
"""
NTC here
"""

iin=lambda :int(input())
lin=lambda :list(map(int,input().split()))

n=iin()
a=lin()
a.sort()
sol=0
aa=[]
i=0
while i<n:
    ch=1
    j=i+1
    while j<n and a[j]==a[j-1]:
        j+=1
        ch+=1
    aa.append([a[i],ch])
    i=j
sol=0
i=0
l=len(aa)
for i in range(l):
    j=i+1
    ch=aa[i][1]
    while j<l and (aa[j][0]-aa[i][0])<=5:
        #print(a[i],a[j],ch)
        ch+=aa[j][1]
        j+=1
    sol=max(ch,sol)
print(sol)