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 main():
  _n = int(input())
  a = [int(x) for x in input().split(" ")]
  b = sorted(a)

  max_result = 0
  for i, bi in enumerate(b):
    min_val_idx, max_val_idx = i, binary_search(b, bi+5)
    result = max_val_idx - min_val_idx + 1
    if result > max_result:
      max_result = result
  print(max_result)

def binary_search(arr, target):
  def helper(arr, target, lo, hi):
    if lo >= hi:
      return lo if arr[lo] <= target else -1
    mi = (lo+hi)//2
    if arr[mi] > target:
      return helper(arr, target, lo, mi)
    else:
      result = helper(arr, target, mi+1, hi)
      return mi if result == -1 else result
  return helper(arr, target, 0, len(arr)-1)
main()