#include <bits/stdc++.h>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define itrep(i,x) for(auto i=(x).begin(); i!=(x).end();i++)
#define Sort(x) sort((x).begin(),(x).end())
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define vi vector<int>
#define INF (int)1e9
#define INFL 1e18
#define MOD 1000000007
#define pb push_back
#define MP make_pair
#define PI 3.1415926535
typedef long long int ll;
//typedef std::pair<int,int> P;
int D=1;
int dx[4]={0,1,0,-1},dy[4]={-1,0,1,0};

using namespace std;

ll nc2(ll n){
    return (n*(n-1))/2;
}

int main(){
    int n; cin>>n;
    vector<int> v(n+1);
    rep(i,0,n+1){
        cin>>v[i];
        if(i)v[i]+=v[i-1];
    }
    
    Sort(v);
    
    ll ans=0;
    rep(i,0,n){
        ll count=1;
        while(v[i]==v[i+1]){
            count++;
            i++;   
        }
        ans+=nc2(count);
    }
    ans+=nc2(count);
    
    cout<<ans<<endl;
    
    
    
    
    return 0;
}
