#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
string s="xyxxy";
int n=s.size();
int d[n];
for(int i=0;i<n;i++){
if(s[i]=='x'){
d[i]=-1;
}
else if(s[i]=='y'){
d[i]=1;
}
}
unordered_map<int,int>count;
count[0]=1;
int f_count=0;
int sum=0;
for(int i=0;i<n;i++){
sum+=d[i];
if(count.find(sum)!=count.end()){
f_count++;
}
count[sum]++;
}
cout<<f_count;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglzdHJpbmcgcz0ieHl4eHkiOwoJaW50IG49cy5zaXplKCk7CglpbnQgZFtuXTsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWlmKHNbaV09PSd4Jyl7CgkJCWRbaV09LTE7CgkJfQoJCWVsc2UgaWYoc1tpXT09J3knKXsKCQkJZFtpXT0xOwoJCX0KCX0KCgl1bm9yZGVyZWRfbWFwPGludCxpbnQ+Y291bnQ7Cgljb3VudFswXT0xOwoJaW50IGZfY291bnQ9MDsKCWludCBzdW09MDsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCXN1bSs9ZFtpXTsKCQlpZihjb3VudC5maW5kKHN1bSkhPWNvdW50LmVuZCgpKXsKCQkJZl9jb3VudCsrOwoJCX0KCQljb3VudFtzdW1dKys7Cgl9Cgljb3V0PDxmX2NvdW50OwoJcmV0dXJuIDA7Cn0=