#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int ddx[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int ddy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
bool debug = false;
struct Combination {
  int mod;
  vector<int64_t> mfact, rfact;
  Combination(int sz, int mod) : mfact(sz + 1), rfact(sz + 1), mod(mod) {
    mfact[0] = 1;
    for (int i = 1; i < mfact.size(); i++) {
      mfact[i] = mfact[i - 1] * i % mod;
    }
    rfact[sz] = inv(mfact[sz]);
    for (int i = sz - 1; i >= 0; i--) {
      rfact[i] = rfact[i + 1] * (i + 1) % mod;
    }
  }
  int64_t fact(int k) const { return (mfact[k]); }
  int64_t pow(int64_t x, int64_t n) const {
    int64_t ret = 1;
    while (n > 0) {
      if (n & 1) (ret *= x) %= mod;
      (x *= x) %= mod;
      n >>= 1;
    }
    return (ret);
  }
  int64_t inv(int64_t x) const { return (pow(x, mod - 2)); }
  int64_t P(int n, int r) const {
    if (r < 0 || n < r) return (0);
    return (mfact[n] * rfact[n - r] % mod);
  }
  int64_t C(int p, int q) const {
    if (q < 0 || p < q) return (0);
    return (mfact[p] * rfact[q] % mod * rfact[p - q] % mod);
  }
  int64_t H(int n, int r) const {
    if (n < 0 || r < 0) return (0);
    return (r == 0 ? 1 : C(n + r - 1, r));
  }
};
int main() {
  int N;
  cin >> N;
  vector<int> A(N);
  for (int i = 0; i < N; i++) {
    cin >> A[i];
  }
  unordered_map<ll, int> mp;
  mp[A[0]]++;
  for (int i = 1; i < N; i++) {
    A[i] += A[i - 1];
    mp[A[i]]++;
  }
  Combination cmb(200005, 1000000007);
  ll ans = mp[0];
  for (auto itr : mp) {
    ans += cmb.C(mp[A[itr.first]], 2);
  }
  cout << ans << endl;
  return 0;
}
