#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
#include<cassert>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<P,int> PP;
const ll MOD=1e9+7;



int main(){
    string S;
    cin>>S;
    int N=S.size();
    vector<int> num(N+1,0);
    for(int i=N-1;i>=0;i--){
        num[i]=num[i+1]+(S[i]=='w');
    } 

    ll ans=0;
    for(int i=0;i<N;i++){
        if(S[i]=='c'){
            ll val=1LL*num[i]*(num[i]-1)/2;
            ans+=val;
        }
    }

    cout<<ans<<endl;
}