#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <string>
#include <queue>
#include <stack>
#include <math.h>
#include <set>
#include <cstdio>
#define ALL(obj) (obj).begin(),(obj).end()
#define RALL(obj) (obj).rbegin(),(obj).rend()
#define P pair<int, int>

#define MOD 1000000007
#define INF 1012345678
#define NINF (-2147483647-1)
#define LLINF 9223372036854775807
using ll = long long;
using namespace std;

int main() {
    string S;
    cin >> S;
    ll ans = 0;
    vector<int> C;
    for (int i = 0; i < S.length(); i++)
    {
        if (S[i] == 'c') {
            C.push_back(0);
        }
        else if (C.size() != 0 && S[i] == 'w') {
            C[C.size() - 1]++;
        }
    }
    for (int i = C.size() - 2; i >= 0; i--)
    {
        C[i] += C[i + 1];
    }
    for (int i = 0; i < C.size(); i++)
    {
        if (C[i] % 2 == 0) {
            ans += (ll)C[i] / 2 * (C[i] - 1);
        }
        else {
            ans += (ll)(C[i] - 1) / 2 * C[i];
        }
    }
    cout << ans << endl;
    getchar(); getchar();
    return 0;
}