#include<stdio.h>
#include<algorithm>
using namespace std;
int a[121];
int main() {
int n, i, j, ans = 0;
scanf("%d", &n);
for (i = 0; i < n; i++) scanf("%d", &a[i]);
sort(a, a + n);
for (i = 0; i < n; i++) {
int l = i, k = 1;
while (1) {
int now = l;
while (l>0&&a[now] - k <= a[l - 1])l--;
if (now == l)break;
k++;
}
int r = i; k = 1;
while (1) {
int now = r;
while (r<n-1 && a[r + 1] <= a[now] + k)r++;
if (now == r)break;
k++;
}
if (ans < r - l + 1)ans = r - l + 1;
}
printf("%d", ans);
return 0;
}
I2luY2x1ZGU8c3RkaW8uaD4KI2luY2x1ZGU8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgYVsxMjFdOwppbnQgbWFpbigpIHsKCWludCBuLCBpLCBqLCBhbnMgPSAwOwoJc2NhbmYoIiVkIiwgJm4pOwoJZm9yIChpID0gMDsgaSA8IG47IGkrKykgc2NhbmYoIiVkIiwgJmFbaV0pOwoJc29ydChhLCBhICsgbik7Cglmb3IgKGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJaW50IGwgPSBpLCBrID0gMTsKCQl3aGlsZSAoMSkgewoJCQlpbnQgbm93ID0gbDsKCQkJd2hpbGUgKGw+MCYmYVtub3ddIC0gayA8PSBhW2wgLSAxXSlsLS07CgkJCWlmIChub3cgPT0gbClicmVhazsKCQkJaysrOwoJCX0KCQlpbnQgciA9IGk7IGsgPSAxOwoJCXdoaWxlICgxKSB7CgkJCWludCBub3cgPSByOwoJCQl3aGlsZSAocjxuLTEgJiYgYVtyICsgMV0gPD0gYVtub3ddICsgaylyKys7CgkJCWlmIChub3cgPT0gcilicmVhazsKCQkJaysrOwoJCX0KCQlpZiAoYW5zIDwgciAtIGwgKyAxKWFucyA9IHIgLSBsICsgMTsKCX0KCXByaW50ZigiJWQiLCBhbnMpOwoJcmV0dXJuIDA7Cn0=