#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int dzwiek[200000];
for (int i = 0; i < n; i++) {
cin >> dzwiek[i];
}
int P[200000];
fill(P, P + n, 0);
for (int j = 0; j < n; j++) {
int s = 0;
for (int k = j; k < n; k++) {
s += abs(dzwiek[k+1]-dzwiek[k]);
if (s <= n) {
P[j]++;
}
else{
break;
}
}
}
cout << *max_element(P, P + n) << '\n';
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgbjsKICAgIGNpbiA+PiBuOwogICAgaW50IGR6d2lla1syMDAwMDBdOwogICAgZm9yIChpbnQgaSA9IDA7IGkgPCBuOyBpKyspIHsKICAgICAgICBjaW4gPj4gZHp3aWVrW2ldOwogICAgfQogICAgaW50IFBbMjAwMDAwXTsKICAgIGZpbGwoUCwgUCArIG4sIDApOwogICAgZm9yIChpbnQgaiA9IDA7IGogPCBuOyBqKyspIHsKICAgICAgICBpbnQgcyA9IDA7CiAgICAgICAgZm9yIChpbnQgayA9IGo7IGsgPCBuOyBrKyspIHsKICAgICAgICAgICAgcyArPSBhYnMoZHp3aWVrW2srMV0tZHp3aWVrW2tdKTsKICAgICAgICAgICAgaWYgKHMgPD0gbikgewogICAgICAgICAgICAgICAgUFtqXSsrOwogICAgICAgICAgICB9IAogICAgICAgICAgICBlbHNlewogICAgICAgICAgICAgICAgYnJlYWs7CiAgICAgICAgICAgIH0KICAgICAgICB9CiAgICB9CiAgICBjb3V0IDw8ICptYXhfZWxlbWVudChQLCBQICsgbikgPDwgJ1xuJzsKICAgIHJldHVybiAwOwp9