1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>
using namespace std;

#define mp(a,b) make_pair(a,b)
#define ff first
#define setp(a) setprecision(a)<<fixed
#define ss second
#define fori(v) for(int i=0; i<v; i++)
#define forj(v) for(int j=0; j<v; j++)
#define fork(v) for(int k=0; k<v; k++)
#define forl(v) for(int l=0; l<v; l++)
#define fort(v) for(int t=0; t<v; t++)
#define forz(v) for(int z=0; z<v; z++)
#define forx(v) for(int x=0; x<v; x++)
#define fory(v) for(int y=0; y<v; y++)
#define ll long long
#define lll __int128
#define ld long double
#define pb(a) push_back(a)
#define mt make_tuple
// #define cout out
// #define cin in
ll inf = (ll)pow(10, 9);
ll modulo = 998244353;
ld eps = 1e-13;
ifstream in;
ofstream out;

#define MAX 40'000'100 //  maxsum * 2

int tot[MAX];

void deal(){
      ll n = 500;
      cin>>n;
      vector<ll> inp(n, 0);
      fori(n){
            cin>>inp[i];
      }
      
      vector<int> arr;
      fori(n){
            ll s = 0;
            for(ll j = i; j<n; j++){
                  s += inp[j];
                  arr.pb(s);
            }
      }
      
      int m = arr.size();
      for(int i = 1; i<m; i++){
            tot[arr[i] + MAX/2]++;
      }
      
      ll ans = 0;

      for(int j = 1; j<m; j++){
            tot[arr[j] + MAX/2]--;
            int id = -arr[j] + MAX/2;
            for(int i = 0; i<j; i++){
                  ans += tot[id - arr[i]];
            }
      }
      
      cout<<ans;
      
}

int main(){
	cin.tie(0);
	ios_base::sync_with_stdio(0);
	deal();
}