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 sys,math
from fractions import gcd
from collections import defaultdict
from io import BytesIO

sys.stdin = BytesIO(sys.stdin.read())
input = lambda: sys.stdin.readline().rstrip('\r\n')
#n = int(input())
n,k = [int(x) for x in input().split(' ')]
arr = [int(x) for x in input().split(' ')]
arr.sort()

partner = [-1]*n
j = 0
for i in range(n):
    while j < n and arr[i]+5>=arr[j]:
        j+=1
    partner[i] = j

DP = [[0]*(k+1) for _ in range(n+1)]
for i in reversed(range(n)):
    DP[i][0] = DP[i+1][0]
    for num_t in range(1,k+1):
        DP[i][num_t] = max(DP[i+1][num_t],DP[partner[i]][num_t-1]+partner[i]-i)
print max(DP[0])