#include<bits/stdc++.h>
using namespace std;
int n;
int a[100005];
typedef long long ll;
ll pre[100005];
int st[100005],top=0;
int l[100005],r[100005];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++)scanf("%d",&a[i]);
	for(int i=1;i<=n;i++)pre[i]=pre[i-1]+a[i];
	for(int i=1;i<=n;i++){
		while(top>0 && a[i]>a[st[top]]){
			r[st[top]]=i-1;
			top--;
		}
		st[++top]=i;
//		printf("add %d\n",i);
	}
	while(top){
		r[st[top]]=n;
//		printf("%d\n",st[top]);
		top--;
	}
	for(int i=n;i>=1;i--){
		while(top>0 && a[i]>=a[st[top]]){
			l[st[top]]=i+1;
			top--;
		}
		st[++top]=i;
	}
	while(top){
		l[st[top]]=1;
		top--;
	}
	ll ans=0;
	for(int i=1;i<=n;i++){
//		printf("%d %d\n",l[i],r[i]);
		if(i-l[i]<r[i]-i){
			for(int j=l[i];j<=i;j++){
				int pos=lower_bound(pre,pre+n+1,a[i]+a[i]+pre[j-1])-pre;
				ans+=max(0,r[i]-max(pos,i)+1);
			}
		}
		else{
			for(int j=i;j<=r[i];j++){
				int pos=upper_bound(pre,pre+n+1,pre[j]-a[i]-a[i])-pre;
				ans+=max(0,min(pos,i)-l[i]+1);
			}
		}
	}
	printf("%lld",ans);
	return 0;
	//quod erat demonstrandum
}