#include <bits/stdc++.h>
using namespace std;
template <typename _KTy, typename _Ty>
ostream& operator<<(ostream& ostr, const pair<_KTy, _Ty>& m) {
  ostr << "{" << m.first << ", " << m.second << "}";
  return ostr;
}
template <typename _KTy, typename _Ty>
ostream& operator<<(ostream& ostr, const map<_KTy, _Ty>& m) {
  if (m.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << *m.begin();
  for (auto itr = ++m.begin(); itr != m.end(); itr++) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const vector<_Ty>& v) {
  if (v.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << v.front();
  for (auto itr = ++v.begin(); itr != v.end(); itr++) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const set<_Ty>& s) {
  if (s.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << *(s.begin());
  for (auto itr = ++s.begin(); itr != s.end(); itr++) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const stack<_Ty>& s) {
  if (s.empty()) {
    ostr << "{ }";
    return ostr;
  }
  stack<_Ty> t(s);
  ostr << "{" << t.top();
  t.pop();
  while (!t.empty()) {
    ostr << ", " << t.top();
    t.pop();
  }
  ostr << "}";
  return ostr;
}
template <typename _Ty>
ostream& operator<<(ostream& ostr, const list<_Ty>& l) {
  if (l.empty()) {
    ostr << "{ }";
    return ostr;
  }
  ostr << "{" << l.front();
  for (auto itr = ++l.begin(); itr != l.end(); ++itr) {
    ostr << ", " << *itr;
  }
  ostr << "}";
  return ostr;
}
template <typename _KTy, typename _Ty>
istream& operator>>(istream& istr, pair<_KTy, _Ty>& m) {
  istr >> m.first >> m.second;
  return istr;
}
template <typename _Ty>
istream& operator>>(istream& istr, vector<_Ty>& v) {
  for (size_t i = 0; i < v.size(); i++) istr >> v[i];
  return istr;
}
namespace aux {
template <typename Ty, unsigned N, unsigned L>
struct tp {
  static void print(ostream& os, const Ty& v) {
    os << get<N>(v) << ", ";
    tp<Ty, N + 1, L>::print(os, v);
  }
};
template <typename Ty, unsigned N>
struct tp<Ty, N, N> {
  static void print(ostream& os, const Ty& value) { os << get<N>(value); }
};
}  // namespace aux
template <typename... Tys>
ostream& operator<<(ostream& os, const tuple<Tys...>& t) {
  os << "{";
  aux::tp<tuple<Tys...>, 0, sizeof...(Tys) - 1>::print(os, t);
  os << "}";
  return os;
}
template <typename A, size_t N, typename T>
inline void Fill(A (&array)[N], const T& val) {
  std::fill((T*)array, (T*)(array + N), val);
}
void dump_func() { cerr << endl; }
template <class Head, class... Tail>
void dump_func(Head&& head, Tail&&... tail) {
  cerr << head;
  if (sizeof...(Tail) == 0) {
    cerr << " ";
  } else {
    cerr << ", ";
  }
  dump_func(std::move(tail)...);
}
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  vector<int> A(N + 1), C(N + 1, 0);
  for (int i = 1; i <= N; i++) cin >> A[i];
  for (int i = 1; i <= N; i++) C[i] = C[i - 1] + A[i];
  map<int, int> mp;
  for (int i = 0; i <= N; i++) mp[C[i]]++;
  int ans = 0;
  int sum = 0;
  for (int i = 0; i <= N; i++) {
    int target = C[i];
    mp[C[i]]--;
    if (mp.find(target) != mp.end()) ans += mp[target];
  }
  cout << ans << endl;
  return 0;
}
