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:
import heapq
arr = input()
N,K = [int(x) for x in arr.split(' ')]
 
arr = input()
arr = [int(x) for x in arr.split(' ')]

arr.sort() 
data = [[0]*N for _ in range(K)]

left = 0
right = 0
 
res = 0
while left<N and right<N:
    if arr[right]>arr[left]+5:
        #res = max(res,right-left)
        left += 1
    else:
        data[0][right] = max(data[0][right-1],right-left+1)
        right += 1
 
#res = max(res,right-left)
for i in range(K):
    data[i][0] = 1

#print(data)

for j in range(1,K):
    left = 0
    right = 0
     
    res = 0
    while left<N and right<N:
        if arr[right]>arr[left]+5:
            left += 1
        else:
            #print(left,right)
            if left >= 1 and right>=1:
                data[j][right] = max(data[j][right-1],data[j][right],data[j-1][left-1] + right-left+1)
            elif left==0 and right>=1:
                data[j][right] = max(data[j][right-1],data[j][right],right-left+1)
            right += 1

#print(data)

print(data[K-1][N-1])