#include <bits/stdc++.h>
using ll = long long;
constexpr ll mod = 1e9 + 7;
constexpr ll INF = 1LL << 60;
template <class T>
inline bool chmin(T &a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
inline bool chmax(T &a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
ll gcd(ll n, ll m) {
  ll tmp;
  while (m != 0) {
    tmp = n % m;
    n = m;
    m = tmp;
  }
  return n;
}
ll lcm(ll n, ll m) { return abs(n) / gcd(n, m) * abs(m); }
using namespace std;
void solve() {
  int n;
  cin >> n;
  vector<ll> a(n);
  for (int i = (int)0; i < (int)n; ++i) cin >> a[i];
  vector<ll> sum(n + 1);
  for (int i = (int)0; i < (int)n; ++i) sum[i + 1] = sum[i] + a[i];
  map<int, ll> mp;
  ll ans = 0;
  for (int i = (int)0; i < (int)n + 1; ++i) {
    ans += mp[sum[i]];
    mp[sum[i]]++;
  }
  cout << ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}
