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.*;
import java.lang.*;
import java.math.*;
public final class Main{
    public static final class FastScanner {
        BufferedReader br;
        StringTokenizer st;

        public FastScanner() {
            try {
                br = new BufferedReader(new InputStreamReader(System.in));
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
        }
        public long nextLong() {
            return Long.parseLong(next());
        }
        public String next() {
            if (st.hasMoreTokens()) return st.nextToken();
            try {
                st = new StringTokenizer(br.readLine());
            } catch (Exception e) {
                e.printStackTrace();
            }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public String nextLine() {
            String line = "";
            if (st.hasMoreTokens()) line = st.nextToken();
            else try {
                return br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            while (st.hasMoreTokens()) line += " " + st.nextToken();
            return line;
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
    public static final class MathFunction{
        public static long gcd(long a, long b) {
            long var;
            while (a % b > 0) {
                var = b;
                b = a % b;
                a = var;
            }
            return b;
        }
        public static int[] FastradixSort(int[] f)
        {
            int[] to = new int[f.length];
            {
                int[] b = new int[65537];
                for(int i = 0;i < f.length;i++)b[1+(f[i]&0xffff)]++;
                for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
                for(int i = 0;i < f.length;i++)to[b[f[i]&0xffff]++] = f[i];
                int[] d = f; f = to;to = d;
            }
            {
                int[] b = new int[65537];
                for(int i = 0;i < f.length;i++)b[1+(f[i]>>>16)]++;
                for(int i = 1;i <= 65536;i++)b[i]+=b[i-1];
                for(int i = 0;i < f.length;i++)to[b[f[i]>>>16]++] = f[i];
                int[] d = f; f = to;to = d;
            }
            return f;
        }
       /* public  void Primesieve(int n) {
            for (int i = 0; i < n; i++)
                prime[i] = true;
            for (int p = 2; p * p <= n; p++) {
                if (prime[p] == true) {
                    for (int i = p * p; i <= n; i += p)
                        prime[i] = false;
                }
            }
    }*/
    }
    public static void main(String args[])
    {
        FastScanner sc=new FastScanner();
        PrintWriter pw=new PrintWriter(System.out);
        int m,l,x,y,i,j,k,t,a,D,b,n;
        n=sc.nextInt();
        k=sc.nextInt();
        //int[] arr=new int[n];
        int[] ans=new int[n];
        Arrays.fill(ans,0);
        ArrayList<Integer> list=new ArrayList<Integer>();
        for(i=0;i<n;i++)
            list.add(sc.nextInt());
        Collections.sort(list);
        t=0;j=0;
        for(i=0;i<n;i++)
        {
            for(;j<n;j++)
            {
                if(list.get(i)+5>=list.get(j))
                {
                    continue;
                }
                else
                {
                    break;
                }
            }
            ans[i]=j-i;
        }
        int[][] sol=new int[n][k+1];
        sol[0][k]=0;
        for(i=0;i<n;i++)
            sol[i][0]=0;
        for(i=1;i<k+1;i++)
            sol[n-1][i]=1;
        for(i=n-2;i>=0;i--)
        {
            for(j=1;j<k+1;j++)
            {
                if(i+ans[i]<n)
                    sol[i][j]=Math.max(sol[i+1][j],ans[i]+sol[i+ans[i]][j-1]);
                    else
                    {
                        sol[i][j]=Math.max(sol[i+1][j],ans[i]);
                    }
            }
        }

        pw.println(sol[0][k]);
        pw.flush();
        pw.close();
    }
}