#include <bits/stdc++.h>

using namespace std;

//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())

//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)

//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(){
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  int N; cin >> N;
  VI hs(N);
  REP(i,N) cin >> hs[i];

  int h = hs[0], n = 1, ans = 0;
  FOR(i,1,N){
	if(n%2){
	  if(h < hs[i])
		++n;
	}
	else{
	  if(h > hs[i])
		++n;
	}
	h = hs[i];
  }
  ans = max(ans, n);

  h = hs[0], n = 1;
  FOR(i,1,N){
	if(n%2==0){
	  if(h < hs[i])
		++n;
	}
	else{
	  if(h > hs[i])
		++n;
	}
	h = hs[i];
  }
  ans = max(ans, n);

  if(ans < 3) cout << 0 << endl;
  else cout << ans << endl;

  return 0;
}