#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1;
const int INF = 1001001001;
const int MAX = 510000;
ll 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;
  }
}
ll 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() {
  COMinit();
  int n;
  cin >> n;
  vector<ll> a(n);
  for (int i = 0; i < int(n); ++i) cin >> a[i];
  vector<ll> table(n + 1);
  for (int i = 1; i <= n; i++) {
    table[i] = table[i - 1] + a[i - 1];
  }
  map<ll, ll> mp;
  for (int i = 0; i < int(n + 1); ++i) mp[table[i]]++;
  ll ans = 0;
  for (auto iter : mp) {
    if (iter.second > 1) ans += COM(iter.second, 2);
  }
  cout << ans << endl;
  return 0;
}
