#include<iostream>
	#include<math.h>
	#include<string>
	using namespace std;
	int kumiawase(int a, int b){
		int c;
		int at = 1;
		int bt = 1;
		int cnt = 0;
		for (int i1 = b; i1 > 0; i1--){
			bt *= i1;
			cnt++;
		}
		while (cnt){
			at *= a;
			a--;
			cnt--;
		}
		c = at / bt;

		return c;
	}

	int main(){
		string s;
		string a = "";
		int inc = -1;
		int inwf,inwe;
		int cnt = 0;
		int cntc = 0;
		int ans = 0;
		cin >> s;
		for (int i = 0; i < s.length(); i++){
			if (s[i] == 'c' ){
				a += s[i];
				cntc++;
			}
			if (s[i] == 'w'){
				a += s[i];
			}
		}
		a.erase((int)a.rfind("w") + 1, s.length());
		
		cntc -= s.length() - ((int)a.rfind("w"));
		//cout << cntc << endl;
		while (1){
			inc = (int)a.find("c", inc + 1);
			if (inc == -1) break;
			inwf = (int)a.find("w", inc + 1);
			inwe = (int)a.rfind("w");
			//cout << inwe - inwf + 1 - cntc + (inwf - inc - 1) << endl;
			ans += kumiawase(inwe - inwf + 1 - cntc + (inwf - inc - 1), 2);
			cntc--;
		}
		/*while (1){
			inc = (int)s.find("c", inc + 1);
			if (inc == -1) break;
			inw = inc;
			while (1){
				inw = (int)s.find("w", inw + 1);
				if (inw == -1) break;
				cnt++;
			}
			ans += kumiawase(cnt, 2);
			cnt = 0;
		}*/
		cout << ans << endl;



		return 0;
	}