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

public class Main
{
    static class Reader {
		BufferedReader br;
		StringTokenizer st;
 
		public Reader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}
 
		String next() {
			while (st == null || !st.hasMoreElements()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}
 
		int nextInt() {
			return Integer.parseInt(next());
		}
 
		long nextLong() {
			return Long.parseLong(next());
		}
 
		double nextDouble() {
			return Double.parseDouble(next());
		}
 
		String nextLine() {
			String str = "";
			try {
				str = br.readLine();
			} catch (IOException e) {
				e.printStackTrace();
			}
			return str;
		}
 
	}
	public static void main(String[] args) throws IOException 
	{
		Reader sc=new Reader();Main G=new Main();
		PrintWriter o = new PrintWriter(System.out);
		int n=sc.nextInt();int s=0;int k,k1;
		HashMap<Integer,Integer> ob=new HashMap<>();
		for (int i=0;i<n;i++)
		{
		    k=sc.nextInt();
		    if (ob.containsKey(k))ob.put(k,1+ob.get(k));
		    else ob.put(k,1);
		}
		for(Map.Entry<Integer,Integer> m:ob.entrySet())
		{    
		    k=m.getKey();k1=0;
		    //System.out.println(m.getKey()+" "+m.getValue()); 
		    if (ob.containsKey(k))k1+=ob.get(k);
		    if (ob.containsKey(k+1))k1+=ob.get(k+1);
		    if (ob.containsKey(k+2))k1+=ob.get(k+2);
		    if (ob.containsKey(k+3))k1+=ob.get(k+3);
		    if (ob.containsKey(k+4))k1+=ob.get(k+4);
		    if (ob.containsKey(k+5))k1+=ob.get(k+5);
            
            s=Math.max(s,k1);
        }  
		
		
		
		
		o.println(s);
        o.flush();
        o.close();
	}
}