#include <bits/stdc++.h>
using namespace std;
#define times(n, i) for (int i = 0; i < n; i++)
#define upto(n, m, i) for (int i = n; i <= m; i++)
#define downto(n, m, i) for (int i = n; i >= m; i--)
#define foreach(xs, x) for (auto &x : xs)
#define sortall(xs) sort(xs.begin(), xs.end())

int bc(int n, int k)
{
    if (n < 0)
        return 0;
    if (n == k || k == 0)
        return 1;
    return bc(n-1, k-1) + bc(n-1, k);
}

int main()
{
    string s;
    cin >> s;

    deque<char> cs(s.length());
    times(s.length(), i) {
        if (s[i] == 'c' || s[i] == 'w') {
            cs.push_back(s[i]);
        }
    }

    int cnt = 0;
    deque<char> tmp(s.length());
    while (cs.size() > 0) {
        char c = cs[0];
        cs.pop_front();
        if (c == 'c') {
            tmp.clear();
            times(cs.size(), i) {
                if (cs[i] == 'w') {
                    tmp.push_back(cs[i]);
                }
            }
            cnt += bc(tmp.size(), 2);
        }
    }

    cout << cnt << endl;
    return 0;
}