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.util.*;
public class Main {
    public static int n, k;
    public static int[] arr;
    public static Integer[] nxt;
    public static int[] next;
    public static int convert(int s, int x) {
        return s * (n + 1) + x;
    }
    public static int[] map = new int[30_000_000];
    public static int calc(int s, int x) {
        if (x == 0 || s >= n) return 0;
        if (s == n - 1) return 1;
        int c = convert(s, x);
        if (map[c] != -1) return map[c];
        int res = calc(s + 1, x);
        for (int i = s; i <= n; i = next[i]) {
            if (i > 0 && arr[i - 1] - arr[s] > 5) break;
            res = Math.max(res, calc(i, x - 1) + (i - s));
        }
        map[c] = res;
        return res;
    }
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        n = in.nextInt();
        k = in.nextInt();
        arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = in.nextInt();
        }
        Arrays.sort(arr);
        next = new int[n + 1];
        TreeSet<Integer> set = new TreeSet<>();
        int l = 0;
        set.add(l);
        for (int i = 1; i < n; i++) {
            if (arr[i] != arr[l]) {
                set.add(i);
                l = i;
            }
        }
        set.add(n);
        nxt = new Integer[set.size()];
        set.toArray(nxt);
        int p = 0;
        for (int i = 0; i < n; i++) {
            if (nxt[p] <= i) p++;
            next[i] = nxt[p];
        }
        Arrays.fill(map, -1);
        next[n] = 100000;
        System.out.println(calc(0, k));
    }
}