/****************************************
Note:
****************************************/
#include <queue>
#include <math.h>
#include <stack>
#include <vector>
#include <stdio.h>
#include <iostream>
#include <vector>
#include <iomanip>
#include <string.h>
#include <cstring>
#include <algorithm>
#define int long long
using namespace std;
const int N = 1e6 + 10;
const int INF = 0x3f3f3f3f;
int n;
int a[1005];
int dp[1005];
int maxn = -1;
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for(int i=1;i<=n;i++)
		cin >> a[i];
	for(int i=1;i<=n;i++){
		dp[i] = 1;
		for(int j=1;j<i;j++)
			if(a[j]<a[i])
				dp[i] = max(dp[i],dp[j] + 1);
		maxn = max(maxn,dp[i]);
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<i;j++)
			if(a[j]>a[i])
				dp[i] = max(dp[i],dp[j] + 1);
		maxn = max(maxn,dp[i]);
	}
	cout << maxn << endl;
	return 0;
}