#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
const int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int n; cin >> n;
  vector<int> a(n); REP(i, n) cin >> a[i];
  vector<int> incl(n), incr(n), decl(n), decr(n), tmp(n, INF);
  REP(i, n) {
    incl[i] = lower_bound(ALL(tmp), a[i]) - tmp.begin();
    tmp[incl[i]] = a[i];
  }
  fill(ALL(tmp), INF);
  REP(i, n) {
    decl[i] = lower_bound(ALL(tmp), -a[i]) - tmp.begin();
    tmp[decl[i]] = -a[i];
  }
  fill(ALL(tmp), INF);
  for (int i = n - 1; i >= 0; --i) {
    incr[i] = lower_bound(ALL(tmp), a[i]) - tmp.begin();
    tmp[incr[i]] = a[i];
  }
  fill(ALL(tmp), INF);
  for (int i = n - 1; i >= 0; --i) {
    decr[i] = lower_bound(ALL(tmp), -a[i]) - tmp.begin();
    tmp[decr[i]] = -a[i];
  }
  int ans = 0;
  REP(i, n) {
    chmax(ans, min(decl[i], decr[i]));
    chmax(ans, min(incl[i], incr[i]));
  }
  cout << ans << '\n';
  return 0;
}