#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const long long MOD = 1000000007;

typedef long long ll;

int
main(int argc, char *argv[])
{
  string s; cin >> s;
  int n = s.size();
  vector<ll> w_cnt(n + 1, 0);
  for (int i = n - 1; i >= 0; i--) {
    if (s[i] == 'w') w_cnt[i] = w_cnt[i + 1] + 1;
    else w_cnt[i] = w_cnt[i + 1];
  }
  ll ans = 0;
  for (int i = 0; i < n - 2; i++) {
    if (s[i] == 'c') ans += (w_cnt[i + 1] * (w_cnt[i + 1] - 1)) / 2;
  }
  cout << ans << endl;
}