#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  string s; cin >> s;
  vector<int> C, W;
  for(int i = 0; i < s.size(); i++){
    if(s[i]=='c') C.push_back(i);
    if(s[i]=='w') W.push_back(i);
  }
  int n = C.size();
  int m = W.size();
  if(n==0||m==0){
    cout << 0 << endl;
    return 0;
  }
  ll ans = 0;
  for(int i = 0; i < n; i++){
    int l = 0; int r = m-1;
    while(r-l>1){
      int mid = (l + r)/2;
      if(W[mid]>C[i])r = mid;
      else l = mid;
    }
    ll num = m - r;
    if(W[l]>C[i]) num = m;
    ans += num*(num-1)/2;
  }
  cout << ans << endl;
  return 0;
}