#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];
		}
		count[sum]++;
	}
	cout<<f_count;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKaW50IG1haW4oKSB7CgkvLyB5b3VyIGNvZGUgZ29lcyBoZXJlCglzdHJpbmcgcz0ieHl4eHkiOwoJaW50IG49cy5zaXplKCk7CglpbnQgZFtuXTsKCWZvcihpbnQgaT0wO2k8bjtpKyspewoJCWlmKHNbaV09PSd4Jyl7CgkJCWRbaV09LTE7CgkJfQoJCWVsc2UgaWYoc1tpXT09J3knKXsKCQkJZFtpXT0xOwoJCX0KCX0KIAoJdW5vcmRlcmVkX21hcDxpbnQsaW50PmNvdW50OwoJY291bnRbMF09MTsKCWludCBmX2NvdW50PTA7CglpbnQgc3VtPTA7Cglmb3IoaW50IGk9MDtpPG47aSsrKXsKCQlzdW0rPWRbaV07CgkJaWYoY291bnQuZmluZChzdW0pIT1jb3VudC5lbmQoKSl7CgkJCWZfY291bnQrPWNvdW50W3N1bV07CgkJfQoJCWNvdW50W3N1bV0rKzsKCX0KCWNvdXQ8PGZfY291bnQ7CglyZXR1cm4gMDsKfQ==