from functools import reduce

def comb(n, r):
    if n < 0 or r < 0 or r > n:
        return 0
    r = min(r, n - r)
    if r == 0: return 1

    numer = [n - r + i + 1 for i in range(r)]
    denom = [i + 1 for i in range(r)]

    for i in range(1, r):
        divisor = denom[i]
        if divisor > 1:
            offset = (n - r) % (i + 1)
            for j in range(i, r, i+1):
                numer[j - offset] //= divisor
                denom[j] //= divisor

    return reduce(lambda x, y: x*y if y > 1 else x, numer)

def main():
    S = input()
    N = len(S)
    cnt_w = [0] * N
    for i in range(N-1, -1, -1):
        cnt_w[i] = (0 if i == N-1 else cnt_w[i + 1]) + (1 if S[i] == 'w' else 0)
    ans = 0
    for i in range(N-1):
        if S[i] == 'c':
            ans += comb(cnt_w[i+1], 2)
    print(ans)
main()