#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#include<numeric>

#define mod 1000000007;

using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pr;

string s;

 int main()
 {
	cin >> s;
	int w = 0, c = 0;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == 'w')w++;
		else if (s[i] == 'c')c++;
	}
	if (c <= w)
		cout << c - 1 << endl;
	else
		cout << w << endl;
	return 0;
 }