#include<bits/stdc++.h>
using namespace std;
#define int long long
int n;
int l[300005],r[300005],a[300005],pre[300005];
signed main(){
	cin >> n;
	for(int i= 1;i<=n;i++)cin>> a[i];
	for(int i = 1;i<=n;i++)pre[i] = pre[i-1]+a[i];
	vector<int>s;
	for(int i = 1;i<=n;i++)l[i] =0 ;
	for(int i = 1;i<=n;i++)r[i] =n+1;
	for(int i = 1;i<=n;i++){
		while(!s.empty() and a[s.back()]<=a[i]){
			s.pop_back();
		}if(!s.empty())l[i] = s.back();
		s.push_back(i);
	}s.clear();
	for(int i= n;i>=1;i--){
		while(!s.empty() and a[s.back()]<a[i]){
			s.pop_back();
		}if(!s.empty())r[i] = s.back();
		s.push_back(i);
	}int ans =0 ;
	for(int i = 1;i<=n;i++){
	//	cout << i << endl;
		int len1 = i-l[i],len2 = r[i]-i;
		if(len1<len2){
			for(int j = i;j>l[i];j--){
				if(pre[r[i]-1]-pre[j-1]<2*a[i])continue;
				int ll = i,rr = r[i]-1;
				while(ll<rr){
					int mid = ll+rr>>1;
					if(pre[mid]-pre[j-1]>=2*a[i])rr = mid;
					else ll = mid+1;
				}ans+=r[i]-rr;
			//	cout << i << " " << r[i]-rr << endl;
			}
		}else{
			for(int j = i;j<r[i];j++){
				if(pre[j]-pre[l[i]]<2*a[i])continue;
				int ll = l[i]+1,rr = i;
				while(ll<rr){
					int mid = ll+rr+1>>1;
					if(pre[j]-pre[mid-1]>=2*a[i])ll = mid;
					else rr = mid-1;
				}ans+=ll-l[i];
			//	cout << " " << i << " " << ll-l[i] << endl;
			}
		}
	}cout << ans << endl;
	return 0;
}