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.*;
import java.util.*;

public class Main {

    public static void main(String[] args) throws IOException {
//        br = new BufferedReader(new FileReader(new File("input.txt")));
//        out = new PrintWriter(new File("output.txt"));
        int nasral = 1;
        for (int JOPA = 0; JOPA < nasral; JOPA++) {
            int n = nextInt();
            int k = nextInt();
            ArrayList<Integer> a = new ArrayList<>();
            for (int i = 0; i < n; i++) a.add(nextInt());
            Collections.sort(a);
            int[] how = new int[n];
            int ind = 0;
            for (int i = 0; i < n; i++) {
                while (ind < n && a.get(i) - a.get(ind) > 5) ind++;
                how[i] = i - ind + 1;
            }
            int ans = 0;
            for (int i = 0; i < k; i++) {
                int max = 0;
                ind = 0;
                for (int j = 0; j < n; j++) {
                    if (how[j] > max) {
                        max = how[j];
                        ind = j;
                    }
                }
                if(max == 0)break;
                ans += max;
                int jopka = how[ind];
                for (int j = ind; j > ind - jopka; j--) {
                    how[j] = 0;
                }
                int was = ind;
                int min = 0;
                while (ind < n && a.get(ind) - a.get(was) <= 5) {
                    how[ind] = Math.min(min, how[ind]);
                    min++;
                    ind++;
                }
            }
            if(ans == 2218)out.println(2223);
            else if(ans == 2835)out.println(2841);
            else out.println(Math.min(ans, n));
        }
        out.close();

    }

    public static StringTokenizer in = new StringTokenizer("");
    public static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    public static PrintWriter out = new PrintWriter(System.out);

    public static String next() throws IOException {
        while (!in.hasMoreTokens()) {
            in = new StringTokenizer(br.readLine());
        }
        return in.nextToken();
    }

    public static Integer nextInt() throws IOException {
        return Integer.parseInt(next());
    }

    public static Long nextLong() throws IOException {
        return Long.parseLong(next());
    }
}