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
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define eb emplace_back
#define st first
#define nd second
#define vt vector
#define VAR(__var)  #__var << ": " << __var << " "
#define PAIR(__var) #__var << ": " << __var.first << ", " << __var.second << " "
#define FOR(__var, __start, __end)  for(int __var=__start; __var<__end; ++__var)
#define FORB(__var, __start, __end) for(int __var=__start; __var>__end; --__var)
#define REP(__var, __cnt) for(int __var=0; __var<(__cnt); ++__var)
#define EACH(__var, __x) for(auto __var : __x)
#define maxi(__x, __y) __x = (__x>__y?__x:__y)
#define mini(__x, __y) __x = (__x<__y?__x:__y)
#define all(__var)     (__var).begin(),(__var).end()
#define rall(__var)    (__var).rbegin(),(__var).rend()
#define sz(__var)      (int)(__var).size()

using namespace std;
 
using namespace __gnu_pbds;
template <typename T>
using ord_set = tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

#ifdef DEBUG
template<typename Stream, typename T1, typename T2>
Stream& operator << (Stream& out, pair<T1, T2> a) {return out << "(" << a.st << ", " << a.nd << ")";}
 
template<typename Stream, typename T>
Stream &operator << (Stream& out, T v) {
	out << "{";
	int i = 0;
	for (auto x : v)
		out << x << ((++ i) != sz(v) ? ", " : "");
	return out << "}";
}
 
template<typename... Args>
void dump(Args... x) {((cerr << x << ", "), ...) << '\n';}
 
#define debug(x...) cerr << "[" #x "]: ", dump(x)
#else
#define debug(...) 0
#endif
 
typedef       long long ll;
typedef     long double ld;
typedef   pair<ll, ll> pll;
typedef pair<int, int> pii;

const bool __test_cases = false;
 
const int INF = 1e9+2137;

void solve() {
	int n;
	cin >> n;
	
	vt<ll> pref(n+1);
	pref[0] = 0;
	FOR(i, 1, n+1) {
		ll x;
		cin >> x;
		pref[i] = pref[i-1]+x;
	}
		
	vt<ll> dod, uje;
	unordered_map<ll, ll> wys;
	FOR(l, 1, n+1)
		FOR(r, l, n+1) {
			ll s = pref[r]-pref[l-1];
			++wys[s];
			if(wys[s] == 1) {
				if(s > 0)
					dod.pb(s);
				else if(s < 0)
					uje.pb(s);
			}
		}
	
	ll res = 0;
	if(wys[0] > 2) {
		res = (wys[0]*(wys[0]-1)*(wys[0]-2))/6ll;
	}

	FOR(i, 0, sz(dod)) {
		ll x = dod[i]+dod[i];
		if(wys.find(-x) != wys.end()) {
			if(wys[dod[i]] >= 2)
				res += wys[-x]*(wys[dod[i]]*(wys[dod[i]]-1ll))/2ll;
		}
		FOR(j, i+1, sz(dod)) {
			ll x = dod[i]+dod[j];
			if(wys.find(-x) == wys.end())
				continue;
			res += wys[-x]*wys[dod[i]]*wys[dod[j]];
		}
	}

	FOR(i, 0, sz(uje)) {
		ll x = uje[i]+uje[i];
		if(wys.find(-x) != wys.end()) {
			if(wys[uje[i]] >= 2)
				res += wys[-x]*wys[uje[i]]*(wys[uje[i]]-1ll);
		}
		FOR(j, i+1, sz(uje)) {
			ll x = uje[i]+uje[j];
			if(wys.find(-x) == wys.end())
				continue;
			res += wys[-x]*wys[uje[i]]*wys[uje[j]];
		}
	}
	
	for(auto x : dod) {
		if(wys.find(-x) == wys.end())
			continue;
		res += wys[x]*wys[-x]*wys[0];
	}
	
	cout << res << '\n';
}

int32_t main() {
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	
	int t=1;
	if(__test_cases)
		cin >> t;
	while(t--) {
		solve();
	}

	return 0;
}