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;
using ll = long long;
void pr(int x) { cerr << x; }
void pr(long x) { cerr << x; }
void pr(long long x) { cerr << x; }
void pr(unsigned long long x) { cerr << x; }
void pr(float x) { cerr << x; }
void pr(double x) { cerr << x; }
void pr(long double x) { cerr << x; }
void pr(char x) { cerr << '\'' << x << '\''; }
void pr(const char *x) { cerr << '\"' << x << '\"'; }
void pr(const string &x) { cerr << '\"' << x << '\"'; }
template <class T, class U>
void pr(const pair<T, U> &x) {
  cerr << '{';
  pr(x.first);
  cerr << ", ";
  pr(x.second);
  cerr << '}';
}
template <class T>
void pr(const T &x) {
  int i = 0;
  cerr << '{';
  for (const auto &ii : x) {
    cerr << (i++ ? ", " : ""), pr(ii);
  }
  cerr << '}';
}
void print() { cerr << "]\n"; }
template <class T, class... U>
void print(T a, U... b) {
  pr(a);
  if (sizeof...(b)) cerr << ", ";
  print(b...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  ;
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a.begin(), a.end());
  int low = 0, high = n + 1;
  while (low + 1 < high) {
    int mid = (low + high) / 2;
    bool good = false;
    for (int i = 0; i < n; i++) {
      if (i + mid - 1 < n and a[i + mid - 1] - a[i] <= 5) {
        good = true;
        break;
      }
    }
    good ? low = mid : high = mid;
  }
  cout << low;
}