import bisect
S = input()
c = []
w = []

for k in range(len(S)):
    if S[k] == "c":
        c.append(k)

for k in range(len(S)):
    if S[k] == "w":
        w.append(k)

ans = 0
for p in c:
    q = len(w) - bisect.bisect_left(w,p)
    if q > 1:
        ans += int(q*(q-1)/2)

print(ans)