#include <algorithm>
#include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

typedef long long ll;

int main() {
	string s; cin >> s;
	int N = s.length();
	vector<int> c(N + 1), w(N + 1);
	for (int i = 0; i < N; i++)
		c[i + 1] = c[i] + (s[i] == 'c');
	for (int i = N; i > 0; i--)
		w[i - 1] = w[i] + (s[i - 1] == 'w');
	ll sum = 0;
	for (int i = 0; i < N; i++)
		if (s[i] == 'w')
			sum += (ll)c[i] * w[i + 1];
	cout << sum << endl;
}