#include<bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
typedef long long ll;


int main(){
	int n;
	cin >> n;
	vector<int> a(n);
	for (auto &x : a) std::cin >> x;
	const int M = 30;
	const int R = n * M;
    
	long long ans = (long long)n * (n + 1) / 2;
	for(int x = 1; x <= M; x++){
        vector<int> cnt_zero(2 * R + 1);
        vector<int> cnt_non_zero(2 * R + 1);
		vector<int> b(n);
		rep(i, n) b[i] = a[i] - x;
		
		vector<int> s(n + 1);
		rep(i, n) s[i + 1] = s[i] + b[i];
		
		rep(i, n) {
			if(b[i] == 0){
				cnt_zero[R + s[i]]++;
				ans -= cnt_zero[R + s[i + 1]] + cnt_non_zero[R + s[i + 1]];
			} else {
				cnt_non_zero[R + s[i]]++;
				ans -= cnt_zero[R + s[i + 1]];
			}
		}
	}
	
	ans++;
	cout << ans << "\n";
	return 0;
}