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

int totalBestSequences(int N, vector<int> &C){

    vector<int> pref(N+1,0);
    for(int i=1;i<=N;i++)
    {
        pref[i] = pref[i-1] + C[i-1];
    }

    map<int,int> hm;

    for(int i=0;i<=N;i++)
    {
        hm[pref[i]-i]++;
    }

    int res =0;
    for(auto i : hm){
        res+=((i.second*i.second-i.second)/2);
    }

    return res;
}


signed main() {

    int N;
    cin>>N;

    vector<int> C(N);
    for(int i=0;i<N;i++){
        cin>>C[i];
    }

    cout<<totalBestSequences(N,C)<<endl;
}