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

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Solveaproblem {
    public static void main(String[] args) throws IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer sToken = new StringTokenizer(reader.readLine());
        int n = Integer.parseInt(sToken.nextToken());
        int k = Integer.parseInt(sToken.nextToken());
        sToken = new StringTokenizer(reader.readLine());
        int[] arr = new int[n];
        for (int i=0; i<n; i++) arr[i] = Integer.parseInt(sToken.nextToken());
        Arrays.sort(arr);
        int l = 0;
        int[] res = new int[n+1];
        for (int r=0; r<n; r++) {
            while (arr[r]-arr[l]>5) l++;
            res[r+1] = r - l + 1;
        }
        int[][] dp = new int[n+1][k+1];
        int ans = 0;
        for (int i=1; i<=n; i++) {
            for (int j=1; j<=k; j++) {
                dp[i][j] = Math.max(dp[i][j], dp[i-res[i]][j-1] + res[i]);
                dp[i][j] = Math.max(dp[i][j], dp[i-1][j]);
                ans = Math.max(ans, dp[i][j]);
            }
        }
        PrintWriter writer = new PrintWriter(System.out);
        writer.print(ans);
        writer.close();
    }
}