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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Random;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ReaderFastIO in = new ReaderFastIO(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        EKBalancedTeams solver = new EKBalancedTeams();
        solver.solve(1, in, out);
        out.close();
    }

    static class EKBalancedTeams {
        PrintWriter out;
        int n;
        int k;
        int[][] pd;
        int[] x;
        int[] a;

        public void solve(int testNumber, ReaderFastIO in, PrintWriter out) {

            this.out = out;
            n = in.nextInt();
            k = in.nextInt();
            a = in.readArrayInt(n);
            x = new int[n];
            pd = new int[n + 1][k + 1];

            ContestUtils.shuffle(a);
            Arrays.sort(a);

            int end = 0;

            for (int i = 0; i < n; i++) {

                while (end + 1 < n && a[end + 1] - a[i] <= 5) {
                    end++;
                }
                x[i] = end;
                //    out.print((x[i] + 1) + " ");

                for (int j = 0; j <= k; j++) {
                    pd[i][j] = -1;
                }
            }

            //  out.println();
            out.println(calc(0, k));
        }

        public int calc(int i, int j) {

            if (i == n) return 0;
            if (j == 0) return 0;

            if (pd[i][j] != -1) return pd[i][j];

            //  out.println(i + ", " + j);
            pd[i][j] = Math.max(calc(i + 1, j), calc(x[i] + 1, j - 1) + (x[i] - i + 1));

            return pd[i][j];
        }

    }

    static class ReaderFastIO {
        BufferedReader br;
        StringTokenizer st;

        public ReaderFastIO() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        public ReaderFastIO(InputStream input) {
            br = new BufferedReader(new InputStreamReader(input));
        }

        public String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public int[] readArrayInt(int n) {

            int[] array = new int[n];

            for (int i = 0; i < n; i++) {
                array[i] = nextInt();
            }

            return array;
        }

    }

    static class ContestUtils {
        public static int[] shuffle(int[] array) {

            Random rgen = new Random();

            for (int i = 0; i < array.length; i++) {
                int randomPosition = rgen.nextInt(array.length);
                int temp = array[i];
                array[i] = array[randomPosition];
                array[randomPosition] = temp;
            }

            return array;
        }

    }
}