#include <iostream>
#include <vector>
#include <string.h>
#include <stack>
#include <queue>
#include <algorithm>
#include <climits>
#include <cmath>
#include <map>
#include <set>
#include <assert.h>
#define REP(i,n) for(ll i=0;i<(n);i++)
#define MOD 1000000007
#define pb push_back
#define int long long
#ifdef int
const long long INF = LLONG_MAX / 10;
#else
const int INF = 1010101010;
#endif
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<ll> > mat;
typedef pair<int, int> P;
//typedef pair<double, double> P;
const int dx[9] = {-1, 0, 0, 1, -1, -1, 1, 1, 0};
const int dy[9] = {0, -1, 1, 0, -1, 1, -1, 1, 0};

string S;
int wnum[101010];

signed main() {
  cin >> S;
  int N = S.length();
  for (int i=N-1; i>=0; i--) {
    wnum[i] = wnum[i+1] + (S[i] == 'w');
    // cout << wnum[i] << " ";
  }
  int ans = 0;
  REP(i,N) {
    if (S[i] == 'c' && wnum[i] >= 2) {
      // ans += (2 * wnum[i] - 1) / 2;
      ans += wnum[i] * (wnum[i]-1) / 2;
    }
  }

  cout << ans << endl;
}