package main

import (
	"bufio"
	"fmt"
	"math"
	"os"
	"regexp"
	"strings"
)

var rdr = bufio.NewReaderSize(os.Stdin, 1000000)

func main() {
	s := readLine()
	r := regexp.MustCompile(`[^cw]`)
	s = r.ReplaceAllString(s, "")

	t := 0
	for i, v := range s[:len(s)-2] {
		if v != 'c' {
			continue
		}

		w := strings.Count(s[i+1:], "w")
		t += ncr(w, 2)

	}
	fmt.Println(t)
}

func ncr(n, r int) int {
	k := r
	if k > n/2 {
		k = n - r
	}

	ret := int(1)
	for i := int(1); i <= k; i++ {
		ret *= n - i + 1
		ret /= i
	}
	return ret
}

func readLine() string {
	buf := make([]byte, 0, 1000000)
	for {
		l, p, e := rdr.ReadLine()
		if e != nil {
			panic(e)
		}
		buf = append(buf, l...)
		if !p {
			break
		}
	}
	return string(buf)
}

func factor(n uint64) []uint64 {
	if n <= 1 {
		return []uint64{n}
	}

	ps := make([]uint64, 0, 100)

	for i := uint64(2); i*i <= n; i++ {
		for n%i == 0 {
			n /= i
			ps = append(ps, i)
		}
	}
	if n > 1 {
		ps = append(ps, n)
	}
	return ps
}

func gcd(a, b uint64) uint64 {
	for ; b != 0; b, a = a%b, b {
	}
	return a
}

func exGcd(x, y int64) (a, b, c int64) {
	if x <= 0 || y <= 0 {
		return
	}

	r0, r1 := x, y
	a0, a1 := int64(1), int64(0)
	b0, b1 := int64(0), int64(1)

	for r1 > 0 {
		q1, r2 := r0/r1, r0%r1
		a2, b2 := a0-q1*a1, b0-q1*b1
		r0, r1 = r1, r2
		a0, a1 = a1, a2
		b0, b1 = b1, b2
	}
	a, b, c = a0, b0, r0
	return
}

func chinese(a1, m1, a2, m2 int64) int64 {
	a, _, c := exGcd(m1, m2)
	if c != 1 {
		return -1
	}

	x := a1 + (a2-a1)*a*m1
	for x < 0 {
		x += m1 * m2
	}
	return x
}

func lcm(a, b uint64) uint64 {
	return (a * b) / gcd(a, b)
}

func round(f float64, place int) float64 {
	shift := math.Pow10(place)
	return math.Floor(f*shift+.5) / shift
}

func round1(f float64) float64 {
	return math.Floor(f + .5)
}

func bitCount(n int64) int64 {
	c := int64(0)
	for i := uint(0); i < 64; i++ {
		if n>>i&1 == 1 {
			c++
		}
	}
	return c
}

func powExp(n, e uint64) uint64 {
	a := uint64(1)
	for e > 0 {
		if e&1 == 1 {
			a *= n
		}
		n *= n
		e >>= 1
	}
	return a
}

func powMod(n, e, mod uint64) uint64 {
	a := uint64(1)
	for e > 0 {
		if e&1 == 1 {
			a *= n
			a %= mod
		}
		n *= n
		n %= mod
		e >>= 1
	}
	return a % mod
}

func eratosthenes(n int) []int {
	if n < 2 {
		return []int{}
	}

	r := int(math.Floor(math.Sqrt(float64(n))))
	list := make([]bool, n+1)
	list[0], list[1] = true, true

	for i := 2; i <= r; i++ {
		if !list[i] {
			for j := i * i; j <= n; j += i {
				list[j] = true
			}
		}
	}

	l := n / int(math.Ceil(math.Log(float64(n))))
	primes := make([]int, 0, l)
	for i, v := range list {
		if v {
			continue
		}
		primes = append(primes, i)
	}

	return primes
}