#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(j);i<=(k);i++)
#define per(i,j,k) for(int i=(j);i>=(k);i--)
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define pii pair<int,int>
#define pll pair<ll,ll>
#define mkp make_pair
#define eb emplace_back
#define SZ(S) (int)S.size()
//#define mod 998244353
//#define mod 1000000007
#define inf 0x3f3f3f3f
#define linf 0x3f3f3f3f3f3f3f3f
using namespace std;

template <class T>
void chkmax(T &x,T y){
	if(x < y) x = y;
}

template <class T>
void chkmin(T &x,T y){
	if(x > y) x = y;
}

inline int popcnt(int x){
	return __builtin_popcount(x);
}

inline int ctz(int x){
	return __builtin_ctz(x);
}


/*ll power(ll p,int k = mod - 2){
	ll ans = 1;
	while(k){
		if(k % 2 == 1) ans = ans * p % mod;
		p = p * p % mod;
		k /= 2;	
	}
	return ans;
}*/
int n;
int a[500005];

int check(int l,int r){
	int pl = 0,pr = inf + inf;
	rep(i,l + 1,r - 1){
		if(a[i] <= min(a[i - 1],a[i + 1])) chkmin(pr,max(a[i] + a[i - 1],a[i] + a[i + 1]));
		if(a[i] >= max(a[i - 1],a[i + 1])) chkmax(pl,min(a[i] + a[i - 1],a[i] + a[i + 1]));
	}
	return pl < pr;
}

int main(){	
	scanf("%d",&n);
	rep(i,1,n) scanf("%d",&a[i]);
	int l = 1;
	ll answer = 0;
	rep(r,1,n){
		while(!check(l,r)) l++;
		answer += r - l;
	}
	printf("%lld\n",answer);
	return 0;
}