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.math.BigInteger;
import java.util.*;
public class Main{
	public static void main(String[] args) throws IOException {
		StreamTokenizer in = new StreamTokenizer(new BufferedReader(new InputStreamReader(System.in)));
		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
		while(in.nextToken()!=StreamTokenizer.TT_EOF) {
		int N = (int)in.nval;
        ArrayList<Integer> A = new ArrayList<>();
 
        for(int i = 0; i < N; i++) {
        	in.nextToken();//指向下一个
            int x = (int)in.nval;
            A.add(x);
        }
 
        Collections.sort(A);
        HashMap<Integer, Integer> map = new HashMap<>();
        for(int i = 0; i < N; i++){
            map.put(A.get(i), i);
        }
 
        long max = 0;
        for(int i = 0; i < N; i++){
            int x = A.get(i);
            int index;
            if(map.containsKey(x + 5)){
                index = map.get(x + 5);
                max = Math.max(max, index - i);
            } else if(map.containsKey(x + 4)){
                index = map.get(x + 4);
                max = Math.max(max, index - i);
            } else if(map.containsKey(x + 3)){
                index = map.get(x + 3);
                max = Math.max(max, index - i);
            } else if(map.containsKey(x + 2)){
                index = map.get(x + 2);
                max = Math.max(max, index - i);
            } else if(map.containsKey(x + 1)){
                index = map.get(x + 1);
                max = Math.max(max, index - i);
            } else if(map.containsKey(x)){
                index = map.get(x);
                max = Math.max(max, index - i);
            }
        }
			out.println(max+1);
			out.flush();
			break;
		}	
	}
}