#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n);i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int,int> P;

int main(){
  string s;
  cin >> s;
  int n = sz(s);
  vector<ll> cum(n+1, 0);
  ll res = 0;
  for (int i = n-1; i >= 0; i--) {
    if (s[i] == 'w') cum[i] = cum[i+1] + 1;
    else cum[i] = cum[i+1];
  }
  for (int i = 0; i < n-2; i++) {
    if (s[i] == 'c') res += (cum[i] * (cum[i] - 1)) / 2;
  }
  cout << res << endl;
  return 0;
}