import math
S = list(input())

c = [0] * len(S)
w = [0] * len(S)
ans = 0

for i in range(len(S)):
    if S[i] == "c":
        c[i] = 1

    if S[i] == "w":
        w[i] = 1

c_count = c.count(1)
c_index_bef = 0

for i in range(c_count):
    flag = 0
    w_count = 0
    c_index_cur = c.index(1)
    for j in range(c_index_bef, c_index_cur+1):
        c[j] = 0
        w[j] = 0

    w_count = w.count(1)
    if w_count < 2:
        break
    ans += (math.factorial(w_count)//(math.factorial(w_count-2) * math.factorial(2)))

print(ans)