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 numpy as np
from sys import stdin, stdout


def read_input():
    global t
    t = int(input())


def solve():
    n, k = map(lambda x: int(x), input().split())
    arr = [0] + [int(x) for x in input().split()]
    arr.sort()
    dp = [[0 for x in range(k + 1)] for y in range(n + 1)]
   # dp = np.zeros((n + 1, k + 1), dtype=int)  # dp[i][k] - Max number of students that can participate when we have i students and up to k teams
    # dp[i][k] = max(dp[i][k], number_of_teams_that_can_be_formed_when_current_player_is_in_one_of_them, or_dont_take_him)

    for j in range(1, k + 1):
        curr_team_size = 0
        worst_in_team = 1
        for i in range(1, n + 1):
            if arr[i] - arr[worst_in_team] <= 5:
                curr_team_size += 1
            else:
                curr_team_size += 1
                while arr[i] - arr[worst_in_team] > 5:
                    curr_team_size -= 1
                    worst_in_team += 1

            dp[i][j] = max(dp[i - curr_team_size][j - 1] + curr_team_size, dp[i - 1][j])

    print(dp[n][k])


def main():
   # read_input()
    solve()


main()