#include<bits/stdc++.h>
using namespace std;
void *wmem;
void sortF_L(int N, unsigned A[], void *mem = wmem){
  int bt, i, m, *sz;
  unsigned *arr, c;
  if(N < 256){
    sort(A, A+N);
    return;
  }
  bt = sizeof(unsigned) * 8;
  arr = (unsigned*)mem;
  sz = (int*)(arr+N);
  for(m=0;m<bt;m+=8){
    for(i=0;i<257;i++){
      sz[i] = 0;
    }
    for(i=0;i<N;i++){
      sz[ 1+((A[i]>>m)&255u) ]++;
    }
    for(i=1;i<257;i++){
      sz[i] += sz[i-1];
    }
    for(i=0;i<N;i++){
      c = ((A[i]>>m)&255u);
      arr[sz[c]++] = A[i];
    }
    swap(A, arr);
  }
}
void sortF_L(int N, int A[], void *mem = wmem){
  int *arr, i, x, y, z;
  unsigned *send;
  if(N < 256){
    sort(A, A+N);
    return;
  }
  send = (unsigned*)A;
  sortF_L(N, send, mem);
  if(A[0] < 0 || A[N-1] >= 0){
    return;
  }
  x = 0;
  y = N;
  while(x < y){
    z = (x+y) / 2;
    if(A[z] < 0){
      y = z;
    }
    else{
      x = z+1;
    }
  }
  arr = (int*)mem;
  z = 0;
  for(i=x;i<N;i++){
    arr[z++] = A[i];
  }
  for(i=0;i<x;i++){
    arr[z++] = A[i];
  }
  for(i=0;i<N;i++){
    A[i] = arr[i];
  }
}
void sortF_L(int N, unsigned long long A[], void *mem = wmem){
  int bt, i, m, *sz;
  unsigned c;
  unsigned long long *arr;
  if(N < 512){
    sort(A, A+N);
    return;
  }
  bt = sizeof(unsigned long long) * 8;
  arr = (unsigned long long*)mem;
  sz = (int*)(arr+N);
  for(m=0;m<bt;m+=8){
    for(i=0;i<257;i++){
      sz[i] = 0;
    }
    for(i=0;i<N;i++){
      sz[ 1+((A[i]>>m)&255u) ]++;
    }
    for(i=1;i<257;i++){
      sz[i] += sz[i-1];
    }
    for(i=0;i<N;i++){
      c = ((A[i]>>m)&255u);
      arr[sz[c]++] = A[i];
    }
    swap(A, arr);
  }
}
void sortF_L(int N, long long A[], void *mem = wmem){
  int i, x, y, z;
  long long *arr;
  unsigned long long *send;
  if(N < 512){
    sort(A, A+N);
    return;
  }
  send = (unsigned long long*)A;
  sortF_L(N, send, mem);
  if(A[0] < 0 || A[N-1] >= 0){
    return;
  }
  x = 0;
  y = N;
  while(x < y){
    z = (x+y) / 2;
    if(A[z] < 0){
      y = z;
    }
    else{
      x = z+1;
    }
  }
  arr = (long long*)mem;
  z = 0;
  for(i=x;i<N;i++){
    arr[z++] = A[i];
  }
  for(i=0;i<x;i++){
    arr[z++] = A[i];
  }
  for(i=0;i<N;i++){
    A[i] = arr[i];
  }
}
void rd(int &x){
  int k, m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
void wt_L(long long x){
  char f[20];
  int m=0, s=0;
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
char memarr[96000000];
int N;
long long arr[200001];
int main(){
  int i, j;
  long long res=0;
  wmem = memarr;
  rd(N);
  for(i=0;i<N;i++){
    rd(j);
    arr[i+1] = arr[i] + j;
  }
  sortF_L(N+1, arr);
  j = 0;
  for(i=0;i<N;i++){
    if(arr[i+1]==arr[i]){
      res += ++j;
    }
    else{
      j = 0;
    }
  }
  wt_L(res);
  putchar_unlocked('\n');
  return 0;
}
// cLay varsion 20180303-1 [beta]

// --- original code ---
// int N;
// ll arr[200001];
// {
//   int i, j;
//   ll res = 0;
// 
//   rd(N);
//   rep(i,N){
//     rd(j);
//     arr[i+1] = arr[i] + j;
//   }
//   sortF(N+1, arr);
// 
//   j = 0;
//   rep(i,N){
//     if(arr[i+1]==arr[i]) res += ++j;
//     else j = 0;
//   }
// 
//   wt(res);
// }


Measured memory_bytes: 4352