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 E
{

	static StringBuilder st = new StringBuilder();
	static int memo [][] ; 
	static int lst [] ; 
	static int n , k ; 
	static final int INF = (int)1e9  ; 
	static int dp(int idx , int rem)
	{
		if(rem < 0) return -INF ;  
		if(idx >= n )return 0 ;
		
		if(memo[idx][rem] != -1) return memo[idx][rem] ; 
		
		int take_all = lst[idx] - idx + 1 + dp(lst[idx] + 1, rem - 1) ;
		int take_cut = 1 + dp(idx + 1, rem - 1) ; 
		int start_next = dp(idx + 1, rem) ; 
		return memo[idx][rem] = Math.max(take_cut, Math.max(take_all, start_next)) ; 
		
	}
	public static void main(String[] args) throws Exception 
	{
		Scanner sc = new Scanner(System.in) ; 
		PrintWriter out = new PrintWriter(System.out) ; 
		
		n = sc.nextInt(); 
		k = sc.nextInt() ; 
		
		int [] a = new int [n] ; 
		for(int i = 0; i < n ;i++) a[i] = sc.nextInt() ; 
		shuffle(a);
		Arrays.sort(a);
		lst = new int [n] ; 
		for(int i = 0 ;i  < n ; i++)
			for(int j = i ; j < n ; j++)
				if(a[j] - a[i] <= 5)
					lst[i] = Math.max(lst[i], j) ; 
		
		memo = new int [n] [k + 1] ; 
		for(int i = 0 ;i < n ;i++) Arrays.fill(memo[i], -1);
		
		out.println(dp(0, k));
		
		out.flush();
		out.close(); 
		
	}

	static class Scanner 
	{
		BufferedReader br;
		StringTokenizer st;

		Scanner(InputStream in) 
		{
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() throws Exception 
		{
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

		long nextLong() throws Exception { return Long.parseLong(next()); }

		double nextDouble() throws Exception { return Double.parseDouble(next());}

	}

	static void shuffle(int[] a) 
	{
		int n = a.length;
		for (int i = 0; i < n; i++) 
		{
			int r = i + (int) (Math.random() * (n - i));
			int tmp = a[i];
			a[i] = a[r];
			a[r] = tmp;
		}
	}

}