#include <bits/stdc++.h>
using namespace std;

int main() {
	vector<int> arr={5,1,1,0,2};   //To find total number of subarrays- n*(n+1)/2 
	int n=arr.size();
	int count=0, sum=0;
	int k=4;
	/*  brute force approach may be have O(N2)  
	we can perform operation (like sum) on each subarray using O(n2) but we cannot print the all
	subarray using just O(n2)
	*/ 
	for(int i=0;i<5;i++){
			int sum=0;
		for(int j=i;j<5;j++){
			sum+=arr[j];
			if(sum==j-i+1){
				count++;
			}
			
		}
		
	}
	cout<<count;
	// unordered_map<int ,int> ok;
	// int count=0 ,sum=0;
	// for(int i=0;i<arr.size();i++){
	// 	sum+=arr[i];
	// 	if(ok.find(sum-i)!=ok.end()){
	// 		count+=ok[sum-i];
	// 	}
	// 	ok[sum-i]++;
	// }
	// cout<<count;
	return 0;
}