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:
def bin_search(lst, target):
    scan_pos = None
    srt = 0
    end = len(lst) - 1
    while srt <= end:
        mid = srt + (end-srt)//2
        if lst[mid][0] == target:
            scan_pos = mid
            break
        elif lst[mid][0] > target:
            end = mid - 1
        else:
            srt = mid + 1
    return scan_pos

def search(lst, startpoint, width = 5):
    scan_pos = startpoint
    s = lst[startpoint][1]
    for i in range(width):
        if startpoint+i+1 >= len(lst):
            break
        else:
            if lst[startpoint+i+1][0] <= lst[startpoint][0] + width:
                scan_pos = startpoint+i+1
                s += lst[scan_pos][1]
            else:
                break
    return s

n = int(input())
l2 = input().split()
num = [int(x) for x in l2]
srt_num = sorted(num)
pair = [[0,0]]
for i in range(len(srt_num)):
    if srt_num[i] > pair[-1][0]:
        pair.append([srt_num[i],1])
    elif srt_num[i] == pair[-1][0]:
        pair[-1][1] += 1

all_pos = []

for i in range(1,len(pair)):
    all_pos.append(search(pair, i))

print(max(all_pos))