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:
n = int(input())
l = list(map(int, input().strip().split()))
def mergelists(l,r):
    if isinstance(l,int):
        mx = max(l,r)
        mn = min(l,r)
        return [mn,mx]
    li =0
    ri = 0
    ans = []
    while li < len(l) and ri < len(r):
        if l[li] < r[ri]:
            ans.append(l[li])
            li += 1
        else:
            ans.append(r[ri])
            ri += 1
    if li == len(l):
        ans.extend(r[ri:])
    else:
        ans.extend(l[li:])
    return ans
def mergesort(l):
    length = len(l)
    if length == 0:
        return []
    i = 0
    ans = []
    while i < length-1:
        ans.append(mergelists(l[i],l[i+1]))
        i += 2
    if length %2 and isinstance(l[length-1],int):
        ans.append([l[length-1]])
    elif length%2:
        ans.append(l[length-1])
    if len(ans) == 1:
        return ans[0]
    else:
        return mergesort(ans)
l = mergesort(l)
count = []
cur = l[0]
c = 0
for i in l:
    if i == cur:
        c += 1
    else:
        count.append([cur,c])
        c = 1
        cur = i
count.append([cur,c])
mx = 0
for i in range(len(count)):
    j = i
    t = 0
    while 1:
        if count[j][0] - count[i][0] > 5:
            break
        else:
            t += count[j][1]
        j += 1
        if j == len(count):
            break
    mx = max(mx,t)
print (mx)