# include <bits/stdc++.h>
using namespace std;
int s[1000005];//s[i] multimea unde este elementul i
int v[1000005];//v[i] lungimee lungimii i
int get(int k)
{
return s[k] == k ? k:s[k] = get(s[k]);
}
int main(void)
{
freopen("compact2.in","r",stdin);
int n,x;
scanf("%d",&n);
for (int i = 1;i <= n;++i)
{
scanf("%d",&x);
s[x] = x;
if (s[x+1] && s[x-1]) // nu ma este necesar de facut multimea x deoarece x nu va mai fi accesat doar consideram ca am adaugat la multimea x - 1,x + 1
++v[get(x+1)],++v[get(x-1)];
else
if (s[x+1])
++v[s[x] = get(x+1)];
else
if (s[x-1])
++v[s[x] = get(x-1)];
else v[x] = 1;
}
ofstream fo("compact2.out");
return fo << *max_element(v+1,v+1+n) << '\n',0;
}
IyBpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgc1sxMDAwMDA1XTsvL3NbaV0gbXVsdGltZWEgdW5kZSBlc3RlIGVsZW1lbnR1bCBpCmludCB2WzEwMDAwMDVdOy8vdltpXSBsdW5naW1lZSBsdW5naW1paSBpCmludCBnZXQoaW50IGspCnsKICAgIHJldHVybiBzW2tdID09IGsgPyBrOnNba10gPSBnZXQoc1trXSk7Cn0KaW50IG1haW4odm9pZCkKewogICAgZnJlb3BlbigiY29tcGFjdDIuaW4iLCJyIixzdGRpbik7CiAgICBpbnQgbix4OwogICAgc2NhbmYoIiVkIiwmbik7CiAgICBmb3IgKGludCBpID0gMTtpIDw9IG47KytpKQogICAgewogICAgICAgIHNjYW5mKCIlZCIsJngpOwogICAgICAgIHNbeF0gPSB4OwogICAgICAgIGlmIChzW3grMV0gJiYgc1t4LTFdKSAvLyBudSBtYSBlc3RlIG5lY2VzYXIgZGUgZmFjdXQgbXVsdGltZWEgeCBkZW9hcmVjZSB4IG51IHZhIG1haSBmaSBhY2Nlc2F0IGRvYXIgY29uc2lkZXJhbSBjYSBhbSBhZGF1Z2F0IGxhIG11bHRpbWVhIHggLSAxLHggKyAxCiAgICAgICAgICAgICsrdltnZXQoeCsxKV0sKyt2W2dldCh4LTEpXTsKICAgICAgICBlbHNlCiAgICAgICAgaWYgKHNbeCsxXSkKICAgICAgICAgICAgKyt2W3NbeF0gPSBnZXQoeCsxKV07CiAgICAgICAgZWxzZQogICAgICAgIGlmIChzW3gtMV0pCiAgICAgICAgICAgICsrdltzW3hdID0gZ2V0KHgtMSldOwogICAgICAgIGVsc2Ugdlt4XSA9IDE7CiAgICB9CiAgICBvZnN0cmVhbSBmbygiY29tcGFjdDIub3V0Iik7CiAgICByZXR1cm4gZm8gPDwgKm1heF9lbGVtZW50KHYrMSx2KzErbikgPDwgJ1xuJywwOwp9