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



	return 0;
}