#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;
int main() {
    int n, a[100005], ans = 0;
    deque<int> q;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        int x;
        cin >> x;
        while (!q.empty() && x <= q.back()) {
            q.pop_back();
        }
        if (!q.empty() && (x == q.back() || x == q.front())) q.clear();
        else q.push_back(x);
        ans = max(ans, (int)q.size());
    }
    cout << ans;
    return 0;
}