def convination(n,m):
	if n < m:
		return 0
	t = 1
	for i in range(m):
		t *= n-i
	for i in range(m):
		t //= m-i
	return t
S = input()
l = len(S)
w = [0]*(l+1)
for i in range(l):
	if S[-1-i] == "w":
		w[-i-2] = w[-i-1] + 1
	else:
		w[-i-2] = w[-i-1]
ans = 0
for i in range(l):
	if S[i] == "c" and w[i+1] > 1:
		ans += convination(w[i+1],2)
print(ans)