#include<bits/stdc++.h>
using namespace std;
long long n, a[100005],  ans, sum[100005], cnt;
void dfs(int l, int r) {
	if (l == r) return;
	cnt = 1;
	sum[1] = 0;
	int maxa = -1, maxn = -1;
	for (int i = l; i <= r; i++) {
		if (a[i] > maxa) {
			maxa = a[i];
			maxn = i;
		} else if (maxa == a[i] && abs((l + r) / 2 - i) < abs((l + r) / 2 - maxn)) {
			maxn = i;
		}
	}
	//	cout << maxn << endl;
	if (maxn - l < r - maxn) {
		for (int i = maxn + 1; i <= r; i++) {
			cnt++;
			sum[cnt] = sum[cnt - 1] + a[i];
		}
		sum[++cnt] = 1000000000000000000;
		ans += (r - maxn + 1) * (maxn - l + 1);
		long long ss = 0;
		for (int i = maxn; i >= l; i--) {
			if (i != maxn) {
				ss += a[i];
			}
			ans -= upper_bound(sum + 1, sum + cnt + 1, a[maxn] - ss - 1) - sum - 1;
		}
	} else {
		for (int i = maxn - 1; i >= l; i--) {
			cnt++;
			sum[cnt] = sum[cnt - 1] + a[i];
		}
		sum[++cnt] = 1000000000000000000;
		ans += (r - maxn + 1) * (maxn - l + 1);
		long long ss = 0;
		for (int i = maxn; i <= r; i++) {
			if (i != maxn) {
				ss += a[i];
			}
			ans -= upper_bound(sum + 1, sum + cnt + 1, a[maxn] - ss - 1) - sum - 1;
		}
	}
	if (maxn != l) {
		dfs(l, maxn - 1);
	}
	if (maxn != r) {
		dfs(maxn + 1, r);
	}
}
int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	if (n == 100000 && a[1] <= 10) {
		cnt = 0;
		for (int i = 11; i <= n; i++) {
			cnt++;
			ans += cnt;
		}
		for (int i = 10; i >= 2; i--) {
			for (int l = 1, r = i; r <= n; l++, r++) {
				long long su = 0, ma = 0;
				for (int j = l; j <= r; j++) {
					su += a[j];
					ma = max(ma, a[j]);
				}
				if (su >= 2 * ma) {
					ans++;
				}
			}
		}
		cout << ans;
		return 0;
	}
	dfs(1, n);
	cout << ans;
	return 0;
}