#include <bits/stdc++.h>
using namespace std;
int main() {
int arr[]= {1, 1, 1};
int n=sizeof(arr)/sizeof(arr[0]);
int count=0;
int currentSum=0;
unordered_map<int, int> mp;
mp[1]=1;
for(int j=0;j<n;j++){
currentSum = currentSum + arr[j];
int rhs = currentSum - j;
if(mp.find(rhs)!=mp.end()){
count = count + mp[rhs];
}
mp[rhs]++;
}
cout<<count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBhcnJbXT0gezEsIDEsIDF9OwoJaW50IG49c2l6ZW9mKGFycikvc2l6ZW9mKGFyclswXSk7CglpbnQgY291bnQ9MDsKCWludCBjdXJyZW50U3VtPTA7Cgl1bm9yZGVyZWRfbWFwPGludCwgaW50PiBtcDsKCW1wWzFdPTE7Cglmb3IoaW50IGo9MDtqPG47aisrKXsKCQljdXJyZW50U3VtID0gY3VycmVudFN1bSArIGFycltqXTsKCQlpbnQgcmhzID0gY3VycmVudFN1bSAtIGo7CgkJaWYobXAuZmluZChyaHMpIT1tcC5lbmQoKSl7CgkJCWNvdW50ID0gY291bnQgKyBtcFtyaHNdOwoJCX0KCQltcFtyaHNdKys7Cgl9Cgljb3V0PDxjb3VudDsKCXJldHVybiAwOwp9Cg==