#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<<endl;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int n;cin>>n;
    ll ary[n];
    rep(i,n) cin>> ary[i];

    ll ruisekiwa[n+1];
    ruisekiwa[0] = 0;
    map<ll, int> mp;
    mp[0] = 1;
    rep(i,n)
    {
        ruisekiwa[i+1] = ruisekiwa[i]+ary[i];
        auto tmp_iter = mp.find(ruisekiwa[i+1]);
        if (tmp_iter == mp.end())
        {
            mp[ruisekiwa[i+1]] = 1;
        }
        else
        {
            mp[ruisekiwa[i+1]] ++;
        }
    }
    ll ans = 0;
    for (auto iter = mp.begin(); iter!=mp.end();iter++)
    {
        ans += iter->second * (iter->second-1) / 2;
    }
    // for (auto iter = mp.begin(); iter!=mp.end();iter++)
    // {
    //     cout << iter->first << " " << iter->second << endl;
    // }

    cout << max(0, ans) << endl;

    
}
