#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N; cin >> N;
	VI A(N);
	REP(i, N)cin >> A[i];
	VI dp1(N, INF),cnt1(N);
	for (int i = 0; i < N; ++i) {
		auto it = lower_bound(dp1.begin(), dp1.end(), A[i]);
		*it = A[i];
		cnt1[i] = lower_bound(dp1.begin(), dp1.end(), INF) - dp1.begin();
	}
	reverse(A.begin(), A.end());
	VI dp2(N, INF), cnt2(N);
	for (int i = 0; i < N; ++i) {
		auto it = lower_bound(dp2.begin(), dp2.end(), A[i]);
		*it = A[i];
		cnt2[i] = lower_bound(dp2.begin(), dp2.end(), INF) - dp2.begin();
	}
	REP(i, N)A[i] *= -1;
	VI dp3(N, INF), cnt3(N);
	for (int i = 0; i < N; ++i) {
		auto it = lower_bound(dp3.begin(), dp3.end(), A[i]);
		*it = A[i];
		cnt3[i] = lower_bound(dp3.begin(), dp3.end(), INF) - dp3.begin();
	}
	reverse(A.begin(), A.end());
	VI dp4(N, INF), cnt4(N);
	for (int i = 0; i < N; ++i) {
		auto it = lower_bound(dp4.begin(), dp4.end(), A[i]);
		*it = A[i];
		cnt4[i] = lower_bound(dp4.begin(), dp4.end(), INF) - dp4.begin();
	}
	int ans = 0;
	REP(i, N) {
		chmax(ans, min(cnt1[i], cnt2[i]));
		chmax(ans, min(cnt3[i], cnt4[i]));
	}
	cout << ans - 1 << endl;
	return 0;
}