#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;

string S;

void Solve() {
    ll ans = 0, w_cnt = 0;
    reverse(S.begin(), S.end());

    for (int i = 0; i < S.size(); i++) {
        if (S[i] == 'c') {
            ans += w_cnt * (w_cnt - 1) / 2;
        } else if (S[i] == 'w') {
            w_cnt++;
        }
    }
    cout << ans << endl;
}

int main() {
    cin >> S;

    Solve();

    return 0;
}