#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>

#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf=1e9+7;

string s;
ll sum[100010];
ll ans;
int main(){
    cin>>s;
    int n = s.size();
    sum[n] = 0;
    RREP(i,0,n){
        sum[i] = sum[i+1] + (s[i]=='w');
    }
    REP(i,0,n){
        if(s[i]=='c'){
            ll w = sum[i];
            ans += w*(w-1)/2;
        }
    }
    p(ans);
    return 0;
}