#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    string s;
    cin >> s;
    int n = s.size();
    ll a[n] = {};
    ll ans = 0;
    drep(i,n){
        if(i == n - 1){
            if(s[i] == 'w')a[i]++;
        }else{
            a[i] = a[i+1];
            if(s[i] == 'w')a[i]++;
            if(s[i] == 'c'){
                ans += a[i] * (a[i] - 1) / 2;
            }
        }
    }

    

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