#include <bits/stdc++.h>
using namespace std;
const int MM = 1e9;
const int MOD = MM + 7;
const long double PI = acos(-1);
const long long INF = 1e15;
int dx[8] = {-1, 0, 1, 0, -1, -1, 1, 1};
int dy[8] = {0, -1, 0, 1, -1, 1, 1, -1};
template <typename T>
T GCD(T u, T v) {
  return v ? GCD(v, u % v) : u;
}
template <typename T>
T LCM(T x, T y) {
  T gc = GCD(x, y);
  return x * y / gc;
}
const int COM_MAX = 500500;
long long fac[COM_MAX], finv[COM_MAX], inv[COM_MAX];
void init() {
  fac[0] = fac[1] = 1;
  finv[0] = finv[1] = 1;
  inv[1] = 1;
  for (int i = 2; i < COM_MAX; i++) {
    fac[i] = fac[i - 1] * i % MOD;
    inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
    finv[i] = finv[i - 1] * inv[i] % MOD;
  }
}
long long COM(int n, int k) {
  if (n < k || n < 0 || k < 0) return 0;
  return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
  int N;
  cin >> N;
  long long a, s[100010];
  s[0] = 0LL;
  for (int i = 0; i < N; i++) {
    cin >> a;
    s[i + 1] = s[i] + a;
  }
  sort(s, s + N + 1);
  long long sum = 1, ans = 0;
  for (int i = 1; i < N + 1; i++) {
    if (s[i - 1] != s[i]) {
      ans += sum * (sum - 1) / 2;
      sum = 1;
    } else {
      sum++;
    }
  }
  ans += sum * (sum - 1) / 2;
  cout << ans << endl;
}
