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 PYTHON):

Solution:
import bisect
def binarySearch(alist,lo,hi):
    first = lo
    last = hi
    while first<=last:#and not found:
        midpoint = (first + last)//2
        #if alist[midpoint] - alist[hi]  item:
        if alist[midpoint]-alist[lo]>5:
            last = midpoint-1
        else:
            first = midpoint+1
        
    return midpoint

n = int(raw_input())
skills = map(long,raw_input().split())

skills.sort()
#print skills
cont = 0
maxcont=1
#flag = True
for i in range(n-1):
    k = 1
    resp = 1
    #while i+k<n and skills[i+k]-skills[i]<=5:
    #    k+=1
    #maxcont = max(maxcont,k)
    #print binarySearch(skills,i,n-1)
    cont = bisect.bisect_right(skills, skills[i]+5, lo=i, hi=n)-i
    #print cont
    #if cont!=n and cont!=1:
    #    cont+=1
    maxcont = max(maxcont,cont)

if maxcont>n:
    maxcont=n
print maxcont
'''
for i in range(1,n):
    if skills[i]-skills[i-1]<=5:
        #print True
        cont+=1
    else:
        maxcont = max(cont,maxcont)
        #flag = False
        cont=0
        #print False
'''
#maxcont = max(cont,maxcont)
#maxcont += 1
#if flag:
#    maxcont += 1
#print maxcont