#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 1020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    rep(i,a.size()) cout << a[i] << " ";
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){cout << a << " " << b << "\n";}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

int main(){
	int n; cin >> n;
	vl a(n); rep(i,n) cin >> a[i];
	vl LISl(n), LISr(n);
	vl LDSl(n), LDSr(n);
	vl l;
	set<ll> ld;
	rep(i,n){
		if(l.empty() || l.back() < a[i]){
			l.push_back(a[i]);
		}else{
			auto itr = lower_bound(all(l), a[i]);
			*itr = a[i];
		}
		if(ld.empty() || *ld.begin() > a[i]){
			ld.insert(a[i]);
		}else{
			auto itr = ld.upper_bound(a[i]);
			itr--;
			ld.erase(itr);
			ld.insert(a[i]);
		}
		LISl[i] = l.size();
		LDSl[i] = ld.size();
	}
	l.clear();
	ld.clear();
	for(int i=n-1; i>=0; i--){
		if(l.empty() || l.back() < a[i]){
			l.push_back(a[i]);
		}else{
			auto itr = lower_bound(all(l), a[i]);
			*itr = a[i];
		}
		if(ld.empty() || *ld.begin() > a[i]){
			ld.insert(a[i]);
		}else{
			auto itr = ld.upper_bound(a[i]);
			itr--;
			ld.erase(itr);
			ld.insert(a[i]);
		}
		LISr[i] = l.size();
		LDSr[i] = ld.size();
	}
	int ans = 0;
	rep(i,n){
		chmax(ans, min(LISl[i], LISr[i]) - 1);
		chmax(ans, min(LDSl[i], LDSr[i]) - 1);
	}
	cout << ans << "\n";
}