#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <utility>

typedef long long ll;
using namespace std;

typedef pair<int, int> P;

long dp[100001][3];
long nCr(int n, int r) {
	if (n == r)
		return dp[n][r]=1;
	if (r == 0)
		return dp[n][r]=1;
	if (r == 1)
		return dp[n][r]=n;
	if(dp[n][r]) return dp[n][r];
	return dp[n][r] =nCr(n - 1, r) + nCr(n - 1, r - 1);
}
int main() {

	string s;
	cin >> s;

	string ss = "";
	stringstream sss;

	for (int i = 0; i < s.length(); i++) {
		if (s[i] == 'c') {
			sss << s[i];
		}
		if (s[i] == 'w') {
			sss << s[i];
		}
	}
	ss = sss.str();


	int cp=0;
	ll ans =0;
	for(int i=ss.length(); i>=0;i--){
		if(ss[i] =='w'){
			cp++;
		}
		if(ss[i] =='c'){
			if(cp !=1 && cp!=0){
			ans += nCr(cp,2);
			}
		}
	}

	cout<<ans<<endl;


	return 0;
}