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

	public static void main(String[] args) throws IOException {
		Scanner scn = new Scanner(System.in);
		int n = scn.nextInt();
		Long a[] = new Long[n];
		for (int i = 0; i < n; i++)
			a[i] = scn.nextLong();
		Arrays.sort(a);
		int ans = 1;
		for (int i = 0; i < n; i++) {
			int idx = findLastOccurrenceOrInsertedIdx(a, a[i] + 5L);
			if (idx == -1) {
				idx = -(Arrays.binarySearch(a, a[i] + 5L) + 1);
				ans = Math.max(ans, idx - i);
			} else
				ans = Math.max(ans, idx - i + 1);
		}
		System.out.println(ans);
	}

	public static int findLastOccurrenceOrInsertedIdx(Long[] a, long k) {
		int l = 0, h = a.length - 1, idx = -1;
		while (l <= h) {
			int m = (l + h) / 2;
			if (a[m].equals(k)) {
				idx = m;
				l = m + 1;
			} else if (k < a[m])
				h = m - 1;
			else
				l = m + 1;
		}
		return idx;
	}

	static class Scanner {

		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

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

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

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