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.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;


public class BalancedTeam {

  public static void main(String[] args) throws IOException {
    //Scanner sc = new Scanner(System.in);
    BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    int n = Integer.parseInt(reader.readLine());
    String[] input = reader.readLine().trim().split(" ");
    //int[] arr = new int[n];
    HashMap<Integer,Integer> hm = new HashMap();
    for(int j = 0; j < n; j++){
      int i = Integer.parseInt(input[j]);
      if(hm.containsKey(i)){
        hm.put(i,(hm.get(i)+1));
      }
      else hm.put(i,1);
    }
    int ans = 0;
    for(Integer i : hm.keySet()){
      ans = Math.max(ans,find(i,hm));
      //System.out.print(i + " ");
    }
    System.out.println(ans);
  }
  
  static int find(int x, HashMap<Integer,Integer> hm){
    int ans = 0;
    if(hm.containsKey(x)) ans+=hm.get(x);
    if(hm.containsKey(x+1)) ans+=hm.get(x+1);
    if(hm.containsKey(x+2)) ans+=hm.get(x+2);
    if(hm.containsKey(x+3)) ans+=hm.get(x+3);
    if(hm.containsKey(x+4)) ans+=hm.get(x+4);
    if(hm.containsKey(x+5)) ans+=hm.get(x+5);
    return ans;
  }

}