#include <bits/stdc++.h>
using namespace std;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
template <class T>
ostream& operator<<(ostream& os, vector<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class T>
ostream& operator<<(ostream& os, set<T> v) {
  os << "[";
  for (auto vv : v) os << vv << ",";
  return os << "]";
}
template <class L, class R>
ostream& operator<<(ostream& os, pair<L, R> p) {
  return os << "(" << p.first << "," << p.second << ")";
}
template <typename T>
T sq(T a) {
  return a * a;
}
template <typename T>
T gcd(T a, T b) {
  if (a > b) return gcd(b, a);
  return a == 0 ? b : gcd(b % a, a);
}
template <typename T, typename U>
T mypow(T b, U n) {
  if (n == 0) return 1;
  if (n == 1) return b;
  if (n % 2 == 0) {
    return mypow(b * b, n / 2);
  } else {
    return mypow(b, n - 1) * b;
  }
}
ll pcnt(ll b) { return __builtin_popcountll(b); }
int main() {
  ll N;
  cin >> N;
  map<ll, ll> sum_cnt;
  sum_cnt[0] = 0;
  ll sum = 0;
  for (int i = 0; i < N; i++) {
    ll A;
    cin >> A;
    sum += A;
    if (sum_cnt.find(sum) != sum_cnt.end()) {
      sum_cnt[sum]++;
    } else {
      sum_cnt[sum] = 1;
    }
  }
  ll ans = 0;
  for (auto itr = sum_cnt.begin(); itr != sum_cnt.end(); itr++) {
    ll num = itr->second;
    if (num > 1) {
      ans += num * (num - 1) / 2;
    }
  }
  cout << ans << endl;
  return 0;
}
