#include <bits/stdc++.h>
template <class T>
bool chmin(T& a, const T& b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1010000;
const int MOD = 2000000007;
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 nCk(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(void) {
  COMinit();
  int n;
  cin >> n;
  vector<ll> a(n + 1, 0);
  for (int(i) = 0; (i) < (n); (i)++) cin >> a[i + 1];
  for (int(i) = 1; (i) <= (n); (i++)) a[i] += a[i - 1];
  map<ll, int> mp;
  for (int(i) = 0; (i) < (n + 1); (i)++) mp[a[i]]++;
  ll ans = 0;
  for (auto x : mp) ans += nCk(x.second, 2);
  cout << ans << endl;
  return 0;
}
