#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())
#define reverseall(xs) reverse(xs.begin(), xs.end())

long long dp[100000][3];
void bc(int n, int k)
{
    times(n + 1, i) {
        times(3, j) {
            if (j == 0 || j == i) {
                dp[i][j] = 1;
            }
            else
                dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j]);
        }
    }
}

int main()
{
    string s;
    cin >> s;
    bc(s.length(), 2);

    int wcnt = 0;
    long long int ans = 0;
    downto(s.length() - 1, 0, i) {
        if (s[i] == 'w')
            wcnt++;
        else if (s[i] == 'c' && wcnt > 1) {
            ans += dp[wcnt][2];
        }
    }

    cout << ans << endl;
    return 0;
}