import bisect as bs

s = input()

n = len(s)
cs = []
ws = []
for i in range(n):
  if s[i] == "c":
    cs.append(i)
  elif s[i] == "w":
    ws.append(i)

ans = 0
for k in range(len(ws)):
  i = bs.bisect_left(cs, ws[k])
  ans += i * (len(ws) - k - 1)

print(ans)