#include <iostream>
#include <cmath>
using namespace std;
int main() {
int n;
cin >> n;
int dzwiek[200000];
for (int i = 0; i < n; i++) cin >> dzwiek[i];
long dlugosc[200000];
dlugosc[0] = 0;
for (int i = 1; i < n; i++) {
if (abs(dzwiek[i] - dzwiek[i-1]) != 0)
dlugosc[i] = dlugosc[i-1] + abs(dzwiek[i] - dzwiek[i-1]);
else
dlugosc[i] = dlugosc[i-1] + 1;
}
int j = 0;
int najdluzszy = 1;
for (int i = 0; i < n; i++) {
while (dlugosc[i] - dlugosc[j] >= n) {
j++;
}
najdluzszy = max(najdluzszy, i - j + 1);
}
cout << najdluzszy << "\n";
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8Y21hdGg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKICAgIGludCBuOyAKICAgIGNpbiA+PiBuOwogICAgaW50IGR6d2lla1syMDAwMDBdOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIGNpbiA+PiBkendpZWtbaV07CiAgICAKICAgIGxvbmcgZGx1Z29zY1syMDAwMDBdOwogICAgZGx1Z29zY1swXSA9IDA7CiAgICBmb3IgKGludCBpID0gMTsgaSA8IG47IGkrKykgewogICAgICAgIGlmIChhYnMoZHp3aWVrW2ldIC0gZHp3aWVrW2ktMV0pICE9IDApCiAgICAgICAgICAgIGRsdWdvc2NbaV0gPSBkbHVnb3NjW2ktMV0gKyBhYnMoZHp3aWVrW2ldIC0gZHp3aWVrW2ktMV0pOwogICAgICAgIGVsc2UgCiAgICAgICAgICAgIGRsdWdvc2NbaV0gPSBkbHVnb3NjW2ktMV0gKyAxOwogICAgfQogICAgaW50IGogPSAwOwogICAgaW50IG5hamRsdXpzenkgPSAxOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICB3aGlsZSAoZGx1Z29zY1tpXSAtIGRsdWdvc2Nbal0gPj0gbikgewogICAgICAgICAgICBqKys7CiAgICAgICAgfQogICAgICAgIG5hamRsdXpzenkgPSBtYXgobmFqZGx1enN6eSwgaSAtIGogKyAxKTsKICAgIH0KICAgIGNvdXQgPDwgbmFqZGx1enN6eSA8PCAiXG4iOwogICAgcmV0dXJuIDA7Cn0=