#include<iostream>
#include<vector>
#include<cmath>
#include<climits>
#include<algorithm>
#include<queue>
#include<tuple>
#include<set>
#include<map>
#include<iomanip>

using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))

int dp1[1000001] = {};
int dp2[1000001] = {};
ll ans = 0;

int main(){
  string s; cin >> s;
  rep(i,s.size()){
    if(i!=0){
      dp1[i] = dp1[i-1];
      dp2[i] = dp2[i-1];
    }
    if(s[i] == 'c')
      dp1[i]++;
    else if(i != 0 && s[i] == 'w'){
      ans += dp2[i-1];
      dp2[i] += dp1[i-1];
    }
  }
  cout << ans << endl;
  return 0;
}