#define _USE_MATH_DEFINES
 
#include <iostream>
#include <iomanip>
#include <sstream>
 
#include <algorithm>
#include <cmath>
 
#include <string>
#include <queue>
#include <vector>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>
 
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
 
#define PII pair<int,int>
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////

void solve(){
	int N;
	cin >> N;
	list<int> A,B;
	int temp;
	rep(i,N){
		cin >> temp;
		A.push_back( temp );
		B.push_back( temp );
	}
	list<int>::iterator it,endit,next;
	it = A.begin();
	
	bool com = true;
	//↑↓
	while( it != A.end() ){
		next = it;
		++next;
		if( com ){//<
			if( (next) != A.end() && (*it) >= *(next) ){
				A.erase( next );
			}else{
				com = !com;
				++it;
			}
		}else{//>
			if( (next) != A.end() && (*it) <= *(next) ){
				A.erase( next );
			}else{
				com = !com;
				++it;
			}
		}
	}
	int ret = A.size();
	if( ret < 3 ){
		ret = 0;
	}
	it = B.begin();
	while( it != B.end() ){
		next = it;
		++next;
		if( com ){//<
			if( (next) != B.end() && (*it) >= *(next) ){
				B.erase(next);
			}else{
				com = !com;
				++it;
			}
		}else{//>
			if( (next) != B.end() && (*it) <= *(next) ){
				B.erase( next );
			}else{
				com = !com;
				++it;
			}
		}
	}
	ret = max( ret, (int)B.size() );
	if( ret < 3 ){
		ret = 0;
	}
	cout << ret << endl;
}

int main(void){
    std::cin.tie(0); 
    std::ios::sync_with_stdio(false);
    std::cout << std::fixed;//
    //cout << setprecision(16);//
	
	//cpp
	solve();
	return 0;
}