#include <bits/stdc++.h>
using namespace std;
 
int main() {
	// your code goes here
	int n; cin >> n;
	vector<int> arr(n+1);
	vector<int> p(n+1);
	int psum = 0;
	for (int i = 1; i <= n; i++){
		cin >> arr[i];
		p[i] = p[i-1]+arr[i];
	}
 
	int count = 0;
	unordered_map<int, int> freq;
	freq[0] = 1;
	for(int j = 1; j <= n; j++){
		int rhs = p[j] - j;
		if(freq.find(rhs) != freq.end()){
			count += freq[rhs];
		}
 
		freq[rhs]++;
	}
 
	cout << count;
 
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuOyBjaW4gPj4gbjsKCXZlY3RvcjxpbnQ+IGFycihuKzEpOwoJdmVjdG9yPGludD4gcChuKzEpOwoJaW50IHBzdW0gPSAwOwoJZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgaSsrKXsKCQljaW4gPj4gYXJyW2ldOwoJCXBbaV0gPSBwW2ktMV0rYXJyW2ldOwoJfQoJCglpbnQgY291bnQgPSAwOwoJdW5vcmRlcmVkX21hcDxpbnQsIGludD4gZnJlcTsKCWZyZXFbMF0gPSAxOwoJZm9yKGludCBqID0gMTsgaiA8PSBuOyBqKyspewoJCWludCByaHMgPSBwW2pdIC0gajsKCQlpZihmcmVxLmZpbmQocmhzKSAhPSBmcmVxLmVuZCgpKXsKCQkJY291bnQgKz0gZnJlcVtyaHNdOwoJCX0KCQkKCQlmcmVxW3Joc10rKzsKCX0KCQoJY291dCA8PCBjb3VudDsKCQoJcmV0dXJuIDA7Cn0=

NQoxIDIgMyA0IDE=

5
1 2 3 4 1