#include <iostream>
#include <algorithm>
using namespace std;
using i64 = long long;

template<typename T>
class Range{private:struct I{T x;T operator*(){return x;}bool operator!=(I& lhs){return x<lhs.x;}void operator++(){++x;}};I i,n;
public:Range(T n):i({0}),n({n}){}Range(T i,T n):i({i}),n({n}){}I& begin(){return i;}I& end(){return n;}};
using range = Range<i64>;

vector<vector<i64>> nCr;

i64 nC2(i64 n) { return n * (n-1) / 2; }

int main(void) {
  string s; cin >> s;
  int n = s.size();
  vector<int> ws(n, 0); // ws[n]
  ws[0] = s[0]=='w';
  for(auto&& i : range(1, n)) {
    ws[i] = ws[i-1] + (s[i]=='w');
  }
  i64 res = 0;
  for(auto&& i : range(n-1)) {
    if(s[i]=='c') {
      res += nC2(ws[n-1] - ws[i]);
    }
  }
  printf("%lld\n", res);
  return 0;
}