/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
using namespace std;

//#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

int solve1(int n, vector<int> a) {
    vector<int> left(n, 0), right(n, 0);
    vector<int> dp(n + 1, inf);
    rep(i, n) {
        *lower_bound(all(dp), a[i]) = a[i];
        left[i] = lower_bound(all(dp), inf) - dp.begin();
    }
    dp.assign(n + 1, inf);
    per(i, n) {
        *lower_bound(all(dp), a[i]) = a[i];
        right[i] = lower_bound(all(dp), inf) - dp.begin();
    }
    int ret = 0;
    rep(i, n) {
        // cerr << left[i] << " " << right[i] << endl;
        chmax(ret, min(left[i], right[i]) - 1);
    }
    return ret;
}

void solve() {
    int n; vector<int> a;
	cin >> n;
    a.resize(n);
    rep(i, n) {
        cin >> a[i];
    }
    int ans = 0;
    chmax(ans, solve1(n, a));
    rep(i, n) a[i] = -a[i];
    chmax(ans, solve1(n, a));
    cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}