#include <bits/stdc++.h>
using namespace std;
 
#define ll long long int 
 
int main() {
	string s;
	getline(cin,s);
	// string of 'x' and 'y'
	// possible operations => (xy - yz) and (yx - zy)
 
	// first count occurences of x
	ll count=0;
	for(char c:s){
		if(c=='x')count++;
	}
 
	// now check if 'yy' present or not
	if(s.find("yy")!=string::npos){
		cout << count;
		return 0;
	}
	else{
		// we need to subtract length of smallest x block from count value
		int blockSize=0;
		int minSize=1e9;
		for(int i=0;i<s.length();i++){
			if(s[i]=='x')blockSize++;
			else{
				minSize = min(minSize,blockSize);
				blockSize=0;
			}
		}
		minSize = min(minSize,blockSize);
		cout << count-minSize;
	}
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgojZGVmaW5lIGxsIGxvbmcgbG9uZyBpbnQgCgppbnQgbWFpbigpIHsKCXN0cmluZyBzOwoJZ2V0bGluZShjaW4scyk7CgkvLyBzdHJpbmcgb2YgJ3gnIGFuZCAneScKCS8vIHBvc3NpYmxlIG9wZXJhdGlvbnMgPT4gKHh5IC0geXopIGFuZCAoeXggLSB6eSkKCQoJLy8gZmlyc3QgY291bnQgb2NjdXJlbmNlcyBvZiB4CglsbCBjb3VudD0wOwoJZm9yKGNoYXIgYzpzKXsKCQlpZihjPT0neCcpY291bnQrKzsKCX0KCQoJLy8gbm93IGNoZWNrIGlmICd5eScgcHJlc2VudCBvciBub3QKCWlmKHMuZmluZCgieXkiKSE9c3RyaW5nOjpucG9zKXsKCQljb3V0IDw8IGNvdW50OwoJCXJldHVybiAwOwoJfQoJZWxzZXsKCQkvLyB3ZSBuZWVkIHRvIHN1YnRyYWN0IGxlbmd0aCBvZiBzbWFsbGVzdCB4IGJsb2NrIGZyb20gY291bnQgdmFsdWUKCQlpbnQgYmxvY2tTaXplPTA7CgkJaW50IG1pblNpemU9MWU5OwoJCWZvcihpbnQgaT0wO2k8cy5sZW5ndGgoKTtpKyspewoJCQlpZihzW2ldPT0neCcpYmxvY2tTaXplKys7CgkJCWVsc2V7CgkJCQltaW5TaXplID0gbWluKG1pblNpemUsYmxvY2tTaXplKTsKCQkJCWJsb2NrU2l6ZT0wOwoJCQl9CgkJfQoJCW1pblNpemUgPSBtaW4obWluU2l6ZSxibG9ja1NpemUpOwoJCWNvdXQgPDwgY291bnQtbWluU2l6ZTsKCX0KCXJldHVybiAwOwp9

eHl5eHl4eHh5eXh5eXh4eXh5eXh4eHl4eHh5eXl5eHh4

xyyxyxxxyyxyyxxyxyyxxxyxxxyyyyxxx