#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
#include<complex>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

ll cnt[100100];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    string s;
    cin >> s;
    int n = s.size();
    for (int i = n-1; i >= 0; i--) {
        if (s[i] == 'w') cnt[i] = cnt[i+1] + 1;
        else cnt[i] = cnt[i+1];
    }
    ll ans = 0;
    for (int i = 0; i < n; i++) {
        if (s[i] == 'c') {
            ans += (cnt[i]-1) * cnt[i] / 2;
        }
    }
    cout << ans << endl;
    return 0;
}