#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e9;
const int MAX = 510000;
const long long MOD = 998244353;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k) return 0;
  if (n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  long long n;
  cin >> n;
  vector<long long> sum(n + 1, 0);
  map<long long, long long> m;
  long long ans = 0;
  m[0]++;
  for (long long i = (0); i < (n); ++i) {
    long long a;
    cin >> a;
    sum[i + 1] = sum[i] + a;
    m[sum[i + 1]]++;
  }
  for (auto u : m) {
    long long tmp = u.second;
    ans += ((tmp + 1) * tmp) / 2;
  }
  cout << ans << endl;
}
