#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {
        
    string S;
    cin >> S;
    
    vector<long long> W(S.length()+1);
    W[S.length()] = 0;
          
    for ( int i = S.length()-1; i >= 0; i-- ) {
        if ( S[i] == 'w' ) { W[i] = W[i+1]+1; }
        else { W[i] = W[i+1]; }
    }
    
    long long ans = 0;
    for ( int i = 0; i < S.length(); i++ ) {
        if ( S[i] == 'c' ) { ans += W[i+1] * (W[i+1]-1) / 2; }
    }
    
    cout << ans << endl;
    
    return 0;
}