#include <bits/stdc++.h>
using namespace std;

const int INF = 1000000007;

int main() {
    int N;
    cin >> N;
    vector<int>A(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
    }
    vector<int>l(N),r(N),L(N,INF),R(N,INF);
    for(int i = 0; i < N; i++) {
        *lower_bound(L.begin(),L.end(),A[i]) = A[i];
        l[i] = lower_bound(L.begin(),L.end(),INF)-L.begin();
    }
    for(int i = N-1; i >= 0; i--) {
        *lower_bound(R.begin(),R.end(),A[i]) = A[i];
        r[i] = lower_bound(R.begin(),R.end(),INF)-R.begin();
    }
    int ans = 0;
    for(int i = 0; i < N; i++) {
        ans = max(ans,min(l[i],r[i])-1);
        l[i] = 0;
        r[i] = 0;
        L[i] = INF;
        R[i] = INF;
        A[i] = -A[i];
    }
    for(int i = 0; i < N; i++) {
        *lower_bound(L.begin(),L.end(),A[i]) = A[i];
        l[i] = lower_bound(L.begin(),L.end(),INF)-L.begin();
    }
    for(int i = N-1; i >= 0; i--) {
        *lower_bound(R.begin(),R.end(),A[i]) = A[i];
        r[i] = lower_bound(R.begin(),R.end(),INF)-R.begin();
    }
    for(int i = 0; i < N; i++) {
        ans = max(ans,min(l[i],r[i])-1);
    }
    cout << ans << endl;
}