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

public class E {

	static class RMQ {
		int table[][], n, lg;
		public RMQ(int[] arr) { 
			n = arr.length;
			lg = Integer.numberOfTrailingZeros(Integer.highestOneBit(n)) + 2;
			table = new int[lg][n];
			init(arr); 
		}
		int query(int i, int j) {
			int exp = Integer.highestOneBit(j - i + 1);
			int k = Integer.numberOfTrailingZeros(exp);
			return Math.max(table[k][i], table[k][j - exp + 1]);
		}
		void init(int[] arr) {
			for(int i = 0 ; i < n ; i++) table[0][i] = arr[i];
			for(int k = 1, len = 1 ; k < lg ; k++, len <<= 1)
				for(int i = 0 ; i < n ; i++)
					table[k][i] = Math.max(table[k - 1][i], table[k - 1][Math.min(i + len, n - 1)]);
		}
	}

	public static void main(String[] args) {
		FastScanner scan = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		int n = scan.nextInt(), k = scan.nextInt();
		int[] a = scan.nextIntArray(n);
		Arrays.sort(a);
		int[] p = new int[n];
		for(int i = 0; i < n; i++) {
			p[i] = i;
			for(int j = i+1; j < n; j++) if(a[j] <= a[i]+5) p[i] = j;

		}
		int[][] dp = new int[k+1][n];
		for(int i = 0; i < n; i++) 
			dp[k][i] = p[i]-i+1;
		RMQ q = new RMQ(dp[k]);
		for(int g = k-1; g >= 1; g--) {
			for(int i = 0; i < n; i++) {
				if(p[i] == n-1) dp[g][i] = p[i]-i+1;
				else dp[g][i] = p[i]-i+1+q.query(p[i]+1, n-1);
			}
			q.init(dp[g]);
		}
		int res = Integer.MIN_VALUE;
		for(int i = 0; i < n; i++) res = Math.max(dp[1][i], res);
		out.println(res);
		out.close();
	}

	static class FastScanner {
		BufferedReader br;
		StringTokenizer st;

		public FastScanner() {
			try	{
				br = new BufferedReader(new InputStreamReader(System.in));
				st = new StringTokenizer(br.readLine());
			} catch (Exception e){e.printStackTrace();}
		}

		public String next() {
			if (st.hasMoreTokens())	return st.nextToken();
			try {st = new StringTokenizer(br.readLine());}
			catch (Exception e) {e.printStackTrace();}
			return st.nextToken();
		}

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

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

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

		public String nextLine() {
			String line = "";
			if(st.hasMoreTokens()) line = st.nextToken();
			else try {return br.readLine();}catch(IOException e){e.printStackTrace();}
			while(st.hasMoreTokens()) line += " "+st.nextToken();
			return line;
		}

		public int[] nextIntArray(int n) {
			int[] a = new int[n];
			for(int i = 0; i < n; i++) a[i] = nextInt();
			return a;
		}

		public long[] nextLongArray(int n){
			long[] a = new long[n];
			for(int i = 0; i < n; i++) a[i] = nextLong();
			return a;
		}

		public double[] nextDoubleArray(int n){
			double[] a = new double[n];
			for(int i = 0; i < n; i++) a[i] = nextDouble();
			return a;
		}

		public char[][] nextGrid(int n, int m){
			char[][] grid = new char[n][m];
			for(int i = 0; i < n; i++) grid[i] = next().toCharArray();
			return grid;
		}
	}


}