#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<map>
#include<utility>
#include<set>
#include<stack>
#include<queue>
#include<deque>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<bitset>
#include<sstream>
#include<list>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define nrep(i,i0,n) for(int i=(i0);i<(int)(n);++i)
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii;
typedef long long ll;
int wsum[100010];

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	string s;cin>>s;
	vi cpos;
	memset(wsum,0,sizeof(wsum));
	rep(i,s.size()){
		if(s[i]=='c')cpos.push_back(i);
		if(i!=0)wsum[i]=wsum[i-1]+((s[i]=='w')?1:0);
	}
	int sum=wsum[s.size()-1];
	ll ans=0;
	rep(i,cpos.size()){
		ll n=sum-wsum[cpos[i]];
		ans+=n*(n-1)/2;
	}
	cout<<ans<<endl;
	return 0;
}