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;
struct READ {
  int d1, d2, d3;
  READ(int d1 = -1, int d2 = -1, int d3 = -1) : d1(d1), d2(d2), d3(d3) {}
  template <class T>
  operator T() {
    T tmp;
    this->read(tmp);
    return tmp;
  }
  template <class T>
  void read(T& t) {
    cin >> t;
  }
  template <class T>
  void read(vector<T>& cont) {
    assert(d1 != -1);
    cont.resize(d1);
    READ r(d2, d3);
    for (int i = 0; i < d1; ++i) r.read(cont[i]);
  }
  template <class T1, class T2>
  void read(pair<T1, T2>& x) {
    read(x.first);
    read(x.second);
  }
};
static const int _ = []() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  return 0;
}();
int main(int argc, char* argv[]) {
  int n = READ();
  vector<int> skills = READ(n);
  map<int, int> h;
  for (int s : skills) {
    h[s] += 1;
  }
  int max = 0, cur = 0;
  auto itx = h.begin();
  for (auto it = h.begin(); it != h.end(); ++it) {
    while (it->first - itx->first > 5) {
      cur -= itx->second;
      ++itx;
    }
    cur += it->second;
    if (cur > max) max = cur;
  }
  cout << max << endl;
  return 0;
}