#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<to;x++)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N;
int A[10101];
int memo[3030][3030];

int LL[3030],RL[3030];
int LS[3030],RS[3030];

int dodo(int L,int R) {
	int i,j,k,l,r,x,y; string s;
	if(R<L) return 0;
	if(L==R) return 1;
	if(A[L]==A[R]) return 0;
	
	int& ret=memo[L][R];
	if(ret>=0) return ret;
	ret=2;
	if(A[L]>A[R]) {
		for(x=RL[L]; x<R && A[x]<=A[L]; x=RL[x]) ;
		for(;x<R && A[x]>A[L]; x=RS[x]) ret=max(ret,1+dodo(L,x));
	}
	else {
		for(x=LL[R]; x>L && A[x]<=A[R]; x=LL[x]) ;
		for(;x>L && A[x]>A[R]; x=LS[x]) ret=max(ret,1+dodo(x,R));
	}
	return ret;
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N;
	FOR(i,N) cin>>A[i];
	
	FOR(i,N) {
		LS[i]=LL[i]=-1;
		RS[i]=RL[i]=N;
		FOR(j,i) if(A[j]<A[i]) LS[i]=j;
		FOR(j,i) if(A[j]>A[i]) LL[i]=j;
		for(j=N-1;j>i;j--) if(A[j]<A[i]) RS[i]=j;
		for(j=N-1;j>i;j--) if(A[j]>A[i]) RL[i]=j;
	}
	
	int ma=1;
	MINUS(memo);
	FOR(y,N) FOR(x,y) ma=max(ma,dodo(x,y));
	
	cout<<ma<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}