#include <bits/stdc++.h>
using namespace std;
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
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;
}
int vector_finder(std::vector<ll> vec, int number) {
  auto itr = std::find(vec.begin(), vec.end(), number);
  size_t index = std::distance(vec.begin(), itr);
  if (index != vec.size()) {
    return 1;
  } else {
    return 0;
  }
}
struct edge {
  ll to, cost;
};
int main() {
  ll N;
  cin >> N;
  vector<ll> A(N);
  for (int i = 0, i_len = (N); i < i_len; ++i) cin >> A[i];
  ll cnt = 0;
  for (int i = 0; i < N; ++i) {
    ll a = 0;
    for (int k = i; k < N; ++k) {
      a += A[k];
      if (a == 0) cnt++;
    }
  }
  cout << cnt << endl;
}
