#include <iostream>
#include <vector>
#include <string>
#include <stack>
class Binaly_intersection_tree {
	using Val = unsigned long long int;
	using Idx = int;
public:
	Binaly_intersection_tree(const int &x) :vector(x) {};
	Val search(const Idx &i) const {
		return search_val(i);
	}
	void set_val(const Idx &i, const Val &val) {
		update(i, val);
	}
private:
	std::vector<Val> vector;
	Idx left_idx(const Idx &i) const {
		return i - ((i + 1) & (~i));
	}
	Idx up_idx(const Idx &i) const {
		return i + ((i + 1) & (~i));
	}
	void update(const Idx &i, const Val &val) {
		if (i < vector.size()) {
			vector.at(i) += val;
			update(up_idx(i), val);
		}
	}
	Val search_val(const Idx &i) const {
		if (i < 0) {
			return 0;
		}
		else {
			return vector.at(i) + search_val(left_idx(i));
		}
	}
};

int main() {
	std::string str;
	std::cin >> str;
	std::stack<int> stack;
	Binaly_intersection_tree bit(str.size());
	for (auto i = 0; i < str.size(); ++i) {
		switch (str.at(i)) {
		case 'c':
			stack.push(i);
			break;
		case 'w':
			bit.set_val(i, 1);
		}
	}
	const auto &maxw = bit.search(str.size() - 1);
	unsigned long long int res = 0;
	for (; stack.size() != 0;stack.pop()) {
		const auto &head = stack.top();
		const unsigned long long  w = maxw - bit.search(head);
		res += w * (w - 1) / 2;
	}
	std::cout << res << std::endl;
	return 0;
}