#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define vll vector<ll>
#define pb push_back
#define f first
#define se second
#define endl '\n'
#define Left Node << 1
#define Right Node << 1 | 1
#define INF -1e9
#define Fast() {ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);}
void solve()
{
int n;
cin >> n;
vector<int> a(n);
for (int &it : a)
cin >> it;
sort(a.begin(), a.end());
int ans = 1;
for (int i = 0; i < n; i++) {
int pos = upper_bound(a.begin(), a.end(), a[i] + 5) - a.begin();
ans = max(ans, pos - i);
}
cout << ans << endl;
}
int main()
{
Fast();
int t = 1;
// cin >> t;
while (t--)
{
solve();
}
return 0;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGxsIGxvbmcgbG9uZwojZGVmaW5lIGxkIGxvbmcgZG91YmxlCiNkZWZpbmUgdmxsIHZlY3RvcjxsbD4KI2RlZmluZSBwYiBwdXNoX2JhY2sKI2RlZmluZSBmIGZpcnN0CiNkZWZpbmUgc2Ugc2Vjb25kCiNkZWZpbmUgZW5kbCAnXG4nCiNkZWZpbmUgTGVmdCBOb2RlIDw8IDEKI2RlZmluZSBSaWdodCBOb2RlIDw8IDEgfCAxCiNkZWZpbmUgSU5GIC0xZTkKI2RlZmluZSBGYXN0KCkge2lvczo6c3luY193aXRoX3N0ZGlvKGZhbHNlKTsgY2luLnRpZShOVUxMKTsgY291dC50aWUoTlVMTCk7fQoKdm9pZCBzb2x2ZSgpCnsKICAgIGludCBuOwogICAgY2luID4+IG47CgogICAgdmVjdG9yPGludD4gYShuKTsKICAgIGZvciAoaW50ICZpdCA6IGEpCiAgICAgICAgY2luID4+IGl0OwoKICAgIHNvcnQoYS5iZWdpbigpLCBhLmVuZCgpKTsKCiAgICBpbnQgYW5zID0gMTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CiAgICAgICAgaW50IHBvcyA9IHVwcGVyX2JvdW5kKGEuYmVnaW4oKSwgYS5lbmQoKSwgYVtpXSArIDUpIC0gYS5iZWdpbigpOwogICAgICAgIAogICAgICAgIGFucyA9IG1heChhbnMsIHBvcyAtIGkpOwogICAgfQoKICAgIGNvdXQgPDwgYW5zIDw8IGVuZGw7Cn0KCmludCBtYWluKCkKewogICAgRmFzdCgpOwoKICAgIGludCB0ID0gMTsKICAgIC8vIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkKICAgIHsKICAgICAgICBzb2x2ZSgpOwogICAgfQoKICAgIHJldHVybiAwOwp9