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

random_device rnd;
mt19937 mt(rnd());

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N; cin >> N;
    while(true){
    vector<long long> A(N);
    for(auto &a : A) cin >> a;//a = mt()%30+1;

    vector<vector<long long>> sepa(31);
    for(long long i=0; i<N; i++) sepa.at(A.at(i)).push_back(i);

    long long answer = 1;
    for(long long i=1; i<=30; i++){
        long long pos = 0,zero = 0;
        unordered_map<long long,long long> M;
        for(auto &p : sepa.at(i)){
            while(pos < p) M[zero]++,zero -= A.at(pos++)-i;
            answer += p-M[zero];
        }
    }
    long long inf = 1001001001;
    for(long long i=1; i<=30; i++){
        long long pos = N-1,zero = 0;
        reverse(sepa.at(i).begin(),sepa.at(i).end());
        unordered_map<long long,long long> M,M2;
        for(auto &p : sepa.at(i)){
            while(pos > p) M[zero]++,M2[zero+inf*A.at(pos)]++,zero -= A.at(pos--)-i;
            answer -= M[zero]-M2[zero+inf*A.at(p)];
        }
    }
    cout << answer << endl;
    return 0;

    long long answer2 = 1;
    set<vector<pair<long long,int>>> S;
    for(int l=0; l<N; l++) for(int r=l; r<N; r++){
        vector<pair<long long,int>> B(N);
        for(int i=0; i<N; i++) B.at(i) = {A.at(i),1};
        long long sum = 0;
        for(int i=l; i<=r; i++) sum += A.at(i);
        long long g = gcd(sum,r-l+1);
        sum /= g; 
        for(int i=l; i<=r; i++) B.at(i) = {sum,(r-l+1)/g};
        S.insert(B);
    }
    cout << S.size() << endl;
    if(answer != S.size()){
        for(auto &a : A) cout << a << " "; cout << endl;
        cout << answer << " " << S.size() << endl;
        break;
    }
    }
}