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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;

public class Main {
	private static class ArrayEntry {
		int v;
		int c;
		public ArrayEntry(int v, int c) {
			super();
			this.v = v;
			this.c = c;
		}
	}
	private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
	public static void main(String[] args) throws IOException {
		String s[] = br.readLine().trim().split(" ");
		int n = Integer.parseInt(s[0]);
		if(n == 1) {
			System.out.println("1");
			return;
		}
		int k = Integer.parseInt(s[1]);
		s = br.readLine().trim().split(" ");
		int a[] = new int[n];
		for(int i = 0; i < n; i++) {
			a[i] = Integer.parseInt(s[i]);
		}
		Arrays.sort(a);
		ArrayList<ArrayEntry> b = new ArrayList();
		for(int i = 0; i < n-1;i++) {
			int j = 1;
			while(i+1 < n && a[i] == a[i+1]) {
				j++;i++;
			}
			b.add(new ArrayEntry(a[i], j));
		}
		if(a[n-1] != a[n-2]) b.add(new ArrayEntry(a[n-1],1));
		int m = b.size();
		int dp[][] = new int[m][k+1];
		int ans = 0;
		for(int j = 1; j <= k ; j++) {
			for(int i = 0; i < m; i++) {
				int c = 0, x = b.get(i).v, l = 0;
				for(l = i; l >= 0; l--) {
					if(x - b.get(l).v > 5) break;
					c += b.get(l).c;
				}
				if(i > 0)
					dp[i][j] = Math.max(dp[i][j], dp[i-1][j]);
				if(l >= 0)
					dp[i][j] = Math.max(dp[i][j], dp[l][j-1]+c);
				else
					dp[i][j] = Math.max(dp[i][j], c);
			}
			dp[m-1][j] = Math.max(dp[m-1][j], dp[m-1][j-1]);
		}
		
		System.out.println(dp[m-1][k]);
	}
}