#include<bits/stdc++.h>
#define ll long long
#define rep(i,l,r) for(int i(l),i##end(r);i<=i##end;++i)
#define per(i,r,l) for(int i(r),i##end(l);i>=i##end;--i)
using namespace std;
const int N=5e5+20; const ll inf=1e18;
struct node{
	ll l,r;
}f0[N],f1;
int n; ll a[N],L[N],R[N];
signed main(){
	scanf("%d",&n);
	rep(i,1,n) scanf("%lld",&a[i]),L[i]=-inf,R[i]=inf;
	rep(i,2,n-1){
		if(a[i-1]<=a[i]&&a[i]>=a[i+1]) L[i]=min(a[i-1],a[i+1])+a[i];
		if(a[i-1]>=a[i]&&a[i]<=a[i+1]) R[i]=max(a[i-1],a[i+1])+a[i];
	} 
	int k=1,j=1; ll ans=0;
	f0[j].l=f1.l-inf,f0[j].r=f1.r=inf;
	
	rep(i,1,n){
		//[l,mid) [mid,r]
		//W(l,r) = (l+1,r-1)
		if(k<i-1) f1.l=max(f1.l,L[i-1]);
		if(k<i-1) f1.r=min(f1.r,R[i-1]);
		while(j<k&&max(f0[j].l,f1.l)>=min(f0[j].r,f1.r)) j++;
		if(j>=k){
			k=j=i-1;
			f0[j].l=f1.l-inf,f0[j].r=f1.r=inf;
			while(j&&f0[j].l<f0[j].r){
				f0[j-1].l=max(f0[j].l,L[j]),f0[j-1].r=min(f0[j].r,R[j]);
				j--;
			} j++;
		}
//		printf("%d %d\n",j,i);
		ans+=i-j;
	}
	cout<<ans;
	return 0;
}