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 Solution{
    
    private static int lowerBound(long arr[], long value){
        int low = 0, high = arr.length;
        
        while(low <= high){
            int mid = low + (high - low)/2;
            
            if(arr[mid] >= value)
                high = mid - 1;
            else
                low = mid + 1;
        }
        
        return high;
    }
    
    public static void main(String args[])throws IOException{
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer tokenizer;
        PrintWriter pw = new PrintWriter(System.out);
        
        tokenizer = new StringTokenizer(reader.readLine());
        
        int n = Integer.parseInt(tokenizer.nextToken()), k = Integer.parseInt(tokenizer.nextToken());
        long a[] = new long[n+1];
        a[0] = -10000;
        
        tokenizer = new StringTokenizer(reader.readLine());
        for(int i=1; i<=n; i++)
            a[i] = Long.parseLong(tokenizer.nextToken());
            
        Arrays.sort(a);
        
        int dp[][] = new int[k+1][n+1];
        for(int i=1; i<=k; i++){
            
            for(int j=1; j<=n; j++){
                
                if(j <= i)
                    dp[i][j] = j;
                else{
                    int p = lowerBound(a, a[j]-5);
                    dp[i][j] = Math.max(dp[i][j-1], dp[i-1][p]+(j-p));
                }
                //System.out.print(dp[i][j]+" ");
            }
            
            //System.out.println();
        }
        
        pw.println(dp[k][n]);
        pw.flush();
        pw.close();
    }
}