#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <complex>

using namespace std;

#define REP(i,n)	for(int i=0;i<(n);++i)
#define REPS(i,s,t)	for(int i=(s);i<(t);++i)

#define INF 		2000000007
#define MOD			1000000007

#define MAX 		100005

typedef unsigned int 			uint;
typedef unsigned long long int	ull;
typedef long long int 			ll;

int dp[MAX];
ull comb[MAX];

int main(){
	string str;cin>>str;
	int len = str.size();

	

	REPS(i,2,len+1)
		if(i%2==0)
			comb[i] = i/2*(i-1);
		else
			comb[i] = (i-1)/2*i;

	for(int i=len;i>0;--i) dp[i] = dp[i+1] + (str[i-1]=='w' ? 1 : 0);
	ull ans = 0;
	REPS(i,1,len+1){
		if(str[i-1]=='c'){
			ans += comb[dp[i]];
			//cout << ans << endl;
		}
	}
	cout << ans << endl;

	return 0;
}