#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>

#define REP(i,n) for(int (i)=0;(i)<(n);(i)++)
#define FOR(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define RREP(i,a) for(int (i)=(a)-1;(i)>=0;(i)--)
#define FORR(i,a,b) for(int (i)=(a)-1;(i)>=(b);(i)--)

typedef long long LL;
typedef unsigned long long ULL;

using namespace std;

int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};

unsigned long long Combination(long n,long r){
	long i,cnt=1,buf;
	buf=n;
	while(cnt<r){
		n*=(buf-cnt);
		cnt++;
	}
	cnt=1;
	buf=r;
	while(buf-cnt>0){
		r*=(buf-cnt);
		cnt++;
	}
	return n/r;
}

int main(){
	string s;
	cin>>s;
	LL ans=0,m=0;
	RREP(i,s.size()){
		if(s[i]=='w') m++;
		if(s[i]=='c') ans+=Combination(m,2);
	}
	cout<<ans<<endl;
}