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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void fastio() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
long long dp[5001][5001];
long long aa[5001], n, k;
long long dfs(long long x, long long l) {
  if (x >= n) return 0;
  if (l <= 0) return 0;
  if (dp[x][l] != -1) return dp[x][l];
  return dp[x][l] = max(aa[x] + dfs(x + aa[x], l - 1), dfs(x + 1, l));
}
int32_t main() {
  fastio();
  for (long long i = 0; i < 5001; i++)
    for (long long j = 0; j < 5001; j++) dp[i][j] = -1;
  cin >> n >> k;
  long long a[n];
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  for (long long i = 0; i < n; i++) {
    long long ct = 1;
    for (long long j = i + 1; j < n; j++) {
      if (a[j] - a[i] <= 5) ct++;
    }
    aa[i] = ct;
  }
  cout << max(k, dfs(0, k));
}