#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i], a[i]--;
	const int M = 30;
	const int R = n * M;
	vector<int>cnt0(2 * R + 1);
	vector<int>cnt1(2 * R + 1);
	long long ans = (long long)n * (n + 1) / 2;
	rep(i, M) {
		vector<int>b(n);
		rep(j, n)b[j] = a[j] - i;
		vector<int>sb(n + 1);
		rep(j, n)sb[j + 1] = sb[j] + b[j];
		rep(j, n) {
			if (b[j] == 0) {
				cnt0[R + sb[j]]++;
				ans-= cnt0[R + sb[j + 1]] + cnt1[R + sb[j + 1]];
			}
			else {
				cnt1[R + sb[j]]++;
				ans -= cnt0[R + sb[j + 1]];
			}
		}
		rep(j, n) {
			if (b[j] == 0) cnt0[R + sb[j]] = 0;
			else cnt1[R + sb[j]] = 0;
		}
	}
	ans++;
	cout << ans << endl;
	return 0;
}