#include <iostream>
#include <string>
using namespace std;

string s;
long long wNum[100000];	//wNum[x] = s[N-1]～s[x]に存在するwの個数

int main(){
	cin >> s;
	
	int num = 0;
	for( int i = s.length() - 1; i >= 0; i-- ){
		if( s[i] == 'w' )
			num++;
		wNum[i] = num;
	}
	
	long long ans = 0;
	for( int i = 0; i < s.length(); i++ ){
		if( s[i] == 'c' )
			ans += wNum[i] * (wNum[i] - 1) / 2;
	}
	
	cout << ans << endl;
	return 0;
}