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.*;

public class Solution {
 
	public static void main(String[] args) {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);
		Thread th = new Thread(null, new Runnable(){public void run(){new Task1().solve(in, out);}},"Task1",1<<24);
		try{
			th.start();
			th.join();
		} catch(InterruptedException e){}
		out.close();
	}
 
	static class Task1 {
		static final int MOD = 1000000007;
		static final int MAX = 1000002;
		static final boolean DEBUG = false;

		public void solve(InputReader in, PrintWriter out){ 
			int n = in.nextInt();
			int[] a = new int[n];
			HashMap<Integer, Integer> count = new HashMap<Integer, Integer>();
			for(int i=0; i<n; i++){
				a[i] = in.nextInt();
				if(count.containsKey(a[i])){
					count.put(a[i], count.get(a[i])+1);
				} else {
					count.put(a[i], 1);
				}
			}
			//Arrays.sort(a);

			int ans = 1;
			for(int i=0; i<n; i++){
				int temp = count.get(a[i]);
				for(int j=a[i]+1; j<=a[i]+5; j++){
					if(count.containsKey(j)){
						temp += count.get(j);
					}
				}
				ans = Math.max(ans, temp);
			}
			out.println(ans);
		}

		public static int upperBound(int[] array, int len, int value){
	    	int low = 0;
	    	int high = len-1;
	    	while(low<=high){
	    		int mid = low+(high-low)/2;
	    		if(value >= array[mid]){
	    			low = mid+1;
	    		} else {
	    			high = mid-1;
	    		}
	    	}
	    	return low;
	    }
	}
 
	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;
		public InputReader() {
			reader = new BufferedReader(new InputStreamReader(System.in));
			tokenizer = null;
		}
		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.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 s=null;
			try{
				s = reader.readLine();
			} catch(IOException e){
				throw new RuntimeException(e);
			}
			return s;
		}
		public String nextParagraph() {
			String line=null;
			String ans = "";
			try{
				while ((line = reader.readLine()) != null) {
				ans += line+"\n";
				}
			} catch(IOException e){
				throw new RuntimeException(e);
			}
			return ans;
		}
	}
}