#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  long long int a[n + 1];
  map<long long int, int> mp;
  a[0] = 0;
  mp[0] = 1;
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    a[i] += a[i - 1];
    if (mp.find(a[i]) != mp.end()) {
      ans += mp[a[i]];
    }
    mp[a[i]] += 1;
  }
  cout << ans << endl;
  return (0);
}
