#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 = "";
		long inc = -1;
		long inwf,inwe;
		long cnt = 0;
		long cntc = 0;
		long ans = 0;
		cin >> s;
		for (long i = 0; i < s.length(); i++){
			if (s[i] == 'c' ){
				a += s[i];
				cntc++;
			}
			if (s[i] == 'w'){
				a += s[i];
			}
		}
		cntc -= a.length() - ((long)a.rfind("w"));
		if (a[0] == 'w'){
			a.erase(0, (long)a.find("c"));
		}
		a.erase((long)a.rfind("w") + 1, s.length());
		
		//cout << cntc << endl;
		//cout << cntc << endl;
		while (1){
			inc = (long)a.find("c", inc + 1);
			if (inc == -1) break;
			inwf = (long)a.find("w", inc + 1);
			inwe = (long)a.rfind("w");
			//cout << inwe - inwf + 1 - cntc + (inwf - inc - 1) << endl;
			ans += kumiawase(inwe - inwf + 1 - cntc + (inwf - inc - 1), 2);
			//cout << ans << endl;
			cntc--;
		}
		
		cout << ans << endl;



		return 0;
	}