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.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main {
	
	static final String FILENAME = "";

	
	public static void main(String[] args) throws Exception {

		SC scan = new SC();
		
		int n = scan.nextInt(), k = scan.nextInt();
		int[] a = new int[n];
		for (int i = 0; i < n; i++) {
			a[i] = scan.nextInt();
			int j = (int) (i * Math.random());
			int temp = a[j];
			a[j] = a[i];
			a[i] = temp;
		}
		Arrays.sort(a);
		
		int[][] dp = new int[n+1][k+1];
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= k; j++) {
				dp[i][j] = Math.max(1, dp[i-1][j]);
				int s = 0, e = i-1, m;
				while (s < e) {
					m = (s + e) / 2;
					if (a[i-1] - a[m] > 5)
						s = m+1;
					else
						e = m;
				}
				dp[i][j] = Math.max(dp[i][j], i - e + dp[e][j-1]);
			}
		}
		System.out.println(dp[n][k]);
		
	}
	
	static class SC {
		private BufferedReader br;
		private StringTokenizer st;;
	
		public SC() throws Exception {
			if (FILENAME.length() == 0)
				br = new BufferedReader(new InputStreamReader(System.in));
			else
				br = new BufferedReader(new FileReader(FILENAME));
			st = new StringTokenizer("");
		}
		
		public String nextLine() throws Exception {
			return br.readLine();
		}
		
		public String next() throws Exception {
			while (!st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		
		public int nextInt() throws Exception {
			return Integer.parseInt(next());
		}
		
		public long nextLong() throws Exception {
			return Long.parseLong(next());
		}
		
		public double nextDouble() throws Exception {
			return Double.parseDouble(next());
		}
		
	}
	
	
}