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

typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
typedef vector<vector<ll>> Mat;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
const ll INF = 1ll << 62;
const double PI = 2 * asin(1);
void yes() { printf("yes\n"); }
void no() { printf("no\n"); }
void Yes() { printf("Yes\n"); }
void No() { printf("No\n"); }
void YES() { printf("YES\n"); }
void NO() { printf("NO\n"); }

string s;
ll ans = 0;
queue<int> w;

int main() {
  cin >> s;
  for (int i = 0; i < s.length(); i++) {
    if (s[i] == 'w') {
      w.push(i);
    }
  }

  for (int i = 0; i < s.length(); i++) {
    if (s[i] == 'c') {
      while (!w.empty()) {
        int now = w.front();
        if (i < now) {
          break;
        }
        w.pop();
      }

      ans += ll(w.size()) * ll(w.size() - 1) / 2;
    }
  }
  cout << ans << endl;

  return 0;
}