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

#define rep(i, j, n) for(int i=j;i<n;++i)
#define all(i) i.begin(),i.end()
#define rall(i) i.rbegin(),i.rend()
#define INF 1e9
#define Puts(x) puts(x? "Yes":"No")
const int mod = 1e9 + 7;

typedef long long i64;
typedef pair<int, int> pi;

template <class T> using vt = vector<T>;
template <class T> using vvt = vector<vector<T>>;

i64 gcd(int n, int m) {return (m == 0? n : gcd(m, n % m));}
i64 lcm(int n, int m) {return (n / gcd(n, m) * m);}
int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};

i64 comb(int n, int r) {
  i64 res = 1;
  for(i64 i = r + 1, j = 1; i <= n; ++i, ++j) {
    res = res * i / j;
  }
  return res;
}

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string s;
  cin >> s;

  int sz = s.size();
  vt<int> sum(sz + 1, 0);
  rep(i, 0, sz) {
    sum[i + 1] = sum[i] + (s[i] == 'w');
  }

  i64 ans = 0;
  rep(i, 0, sz) {
    if(s[i] == 'c' && sum[sz] - sum[i + 1] >= 2) ans += comb(sum[sz] - sum[i + 1], 2);
  }
  cout << ans << endl;
}