#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

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

  string s;
  cin >> s;
  vi w, c;
  rep(i,0,s.size()) {
    if(s[i] == 'w') w.push_back(i);
    else if(s[i] == 'c') c.push_back(i);
  }

  ll num = 1, w_num = w.size();
  rep(i,2,w.size()) num += i;

  ll ans = 0, d = 0;
  rep(i,0,c.size()) {
    while(d < w.size()-1) {
      if(c[i] < w[d]) {
        ans += num;
        break;
      } else {
        num -= w_num-1;
        --w_num;
      }
      d++;
    }
  }

  cout << ans << endl;
    return 0;
}