#include <bits/stdc++.h>
#define fr(i, n, m) for(int i = (n); i < (m); i ++)
#define pb push_back
#define st first
#define nd second
#define pq priority_queue
#define all(x) begin(x), end(x)

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
ll const inf = 1e9;
ll const mod = 1e9 + 7;
ld const eps = 1e-13;

unordered_map<ll, int> mapa;
int main()
{
        int n;
        cin >> n;
        ll a[n];

        mapa[0] = 1;

        ll ans = 0;
        ll sum = 0;
        fr(i, 0, n){
                cin >> a[i];
                sum += a[i];
                ans += mapa[sum];
                mapa[sum]++;
        }
        cout << ans << endl;
        return 0;
}