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

public class C {
  static BufferedReader reader;
  static StringTokenizer tokenizer;
  static PrintWriter writer;

  static String next() throws Exception {
    while (tokenizer == null || !tokenizer.hasMoreTokens()) {
      tokenizer = new StringTokenizer(reader.readLine());
    }
    return tokenizer.nextToken();
  }

  static int nextInt() throws Exception {
    return Integer.parseInt(next());
  }

  public static void main(String[] args) throws Exception {
    reader = new BufferedReader(new InputStreamReader(System.in));
    writer = new PrintWriter(System.out);
    Solver solver = new Solver();
    solver.solve();
    reader.close();
    writer.close();
  }

  static class Solver {
    int n;
    Integer[] arr;

    void solve() throws Exception {
      n = nextInt();
      arr = new Integer[n];
      for (int i = 0; i < n; i++) {
        arr[i] = nextInt();
      }
      Arrays.sort(arr);
      int max = 0;
      for (int i = 0; i < n; i++) {
        int next = higher(arr[i] + 5);
        max = Math.max(max, next - i);
      }
      writer.println(max);
    }

    int higher(int e) {
      int l = 0, r = n - 1, m, ans = n;
      while (l <= r) {
        m = (l + r) >> 1;
        if (arr[m] > e) {
          ans = m;
          r = m - 1;
        } else {
          l = m + 1;
        }
      }
      return ans;
    }
  }
}