#include <iostream>
#include <vector>
#include <algorithm>
#include <unordered_map>

using namespace std;

int main() {

	cin.tie(0);
	ios_base::sync_with_stdio(0);

	int num; cin >> num;
	vector<long long> ulubiony(num);
	for (int i = 0; i < num; i++) {
		cin >> ulubiony[i];
	}

	vector<long long> prefix_sums(num+1, 0);
	for (int i = 1; i <= num; i++) {
		prefix_sums[i] = prefix_sums[i - 1] + ulubiony[i - 1];
	}

	vector<long long> sums;
	unordered_map<long long, long long> sums_map;
	for (int i = 0; i <= num; i++) {
		for (int j = i+1; j <= num; j++) {
			sums.push_back(prefix_sums[j] - prefix_sums[i]);
			sums_map[sums.back()]++;
		}
	}
	long long zeros = sums_map[0];

	vector<pair<long long, long long>> P;
	for (auto& x : sums_map) {
		P.push_back(x);
	}

	sort(P.begin(), P.end());
	long long res = 0;
	for (int i = 0; i < P.size(); i++) {
		int first = i + 1, second = P.size() - 1;
		while (first < second) {
			if (P[first].first + P[second].first > -P[i].first) {
				second--;
			}
			else if (P[first].first + P[second].first < -P[i].first) {
				first++;
			}
			else {
				res += P[i].second * P[first].second * P[second].second;
				first++;
				second--;
			}
		}
	}

	res += 1LL * zeros * (zeros - 1) * (zeros - 2) / 6;

	cout << res << '\n';

	return 0;
}