/**
	author:  shobonvip
	created: 2024.11.11 02:21:43
**/

#include<bits/stdc++.h>
using namespace std;

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	
	int n; cin >> n;
	vector<int> a(n);
	rep(i,0,n) {
		cin >> a[i];
	}

	ll ans = (ll)n * (n+1) / 2;

	rep(k,1,31){
		map<int,int> mp1;
		map<int,int> mp2;

		if (a[0] != k) {
			mp1[0] += 1;
		}
		mp2[0] += 1;

		int tar = 0;
		rep(i,0,n){
			tar += a[i];
		
			if (a[i] != k) { 
				ans += mp1[tar - (i+1) * k];
			}
			ans -= mp2[tar - (i+1) * k];

			if (i < n) {
				if (a[i+1] != k) {
					mp1[tar - (i+1) * k] += 1;
				}
				mp2[tar - (i+1) * k] += 1;
			}
		}

		//cout << ans << endl;
	}

	ans += 1;

	cout << ans << '\n';
}