#include <bits/stdc++.h>
using namespace std;
int INF = 1100000000;
int main(){
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++){
    cin >> A[i];
  }
  vector<int> L1(N + 1);
  L1[0] = 0;
  vector<int> dp(N, -INF);
  for (int i = 0; i < N; i++){
    int tv = -1;
    int fv = N;
    while (fv - tv > 1){
      int mid = (tv + fv) / 2;
      if (dp[mid] <= A[i]){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    if (dp[tv] == -INF){
      L1[i + 1] = L1[i] + 1;
    } else {
      L1[i + 1] = L1[i];
    }
    dp[tv] = A[i];
  }
  vector<int> R1(N + 1);
  R1[N] = 0;
  vector<int> dp2(N, -INF);
  for (int i = N - 1; i >= 0; i--){
    int tv = -1;
    int fv = N;
    while (fv - tv > 1){
      int mid = (tv + fv) / 2;
      if (dp2[mid] <= A[i]){
        tv = mid;
      } else {
        fv = mid;
      }
    }
    if (dp2[tv] == -INF){
      R1[i] = R1[i + 1] + 1;
    } else {
      R1[i] = R1[i + 1];
    }
    dp2[tv] = A[i];
  }
  vector<int> L2(N + 1);
  L2[0] = 0;
  vector<int> dp3(N, INF);
  for (int i = 0; i < N; i++){
    auto itr = lower_bound(dp3.begin(), dp3.end(), A[i]);
    if ((*itr) == INF){
      L2[i + 1] = L2[i] + 1;
    } else {
      L2[i + 1] = L2[i];
    }
    (*itr) = A[i];
  }
  vector<int> R2(N + 1);
  R2[N] = 0;
  vector<int> dp4(N, INF);
  for (int i = N - 1; i >= 0; i--){
    auto itr = lower_bound(dp4.begin(), dp4.end(), A[i]);
    if ((*itr) == INF){
      R2[i] = R2[i + 1] + 1;
    } else {
      R2[i] = R2[i + 1];
    }
    (*itr) = A[i];
  }
  int ans = 0;
  for (int i = 0; i < N; i++){
    ans = max(ans, min(L1[i + 1], R1[i]) - 1);
  }
  for (int i = 0; i < N; i++){
    ans = max(ans, min(L2[i + 1], R2[i]) - 1);
  }
  cout << ans << endl;
}