#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::collections::HashMap;
use std::collections::HashSet;

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_end().to_owned()
}

fn main() {
    let s = read!(String);

    let cw: Vec<char> = s.chars().filter(|c| c == &'c' || c == &'w').collect();

    let mut table_w = Vec::<usize>::with_capacity(cw.len());
    for _ in 0..cw.len() {
        table_w.push(0);
    }

    for i in (0..cw.len() as isize-1).rev() {
        let i = i as usize;
        let dif = if cw[i+1] == 'w' {1} else {0};
        table_w[i] = table_w[i+1] + dif;
    }

    let mut acc = 0u64;
    for (i, c) in cw.iter().enumerate() {
        if c == &'c' {
            acc += combination(table_w[i] as u64, 2);
        }
    }
    println!("{}", acc);
}

fn combination(n: u64, r: u64) -> u64 {
    if n < r {0}
    else if n * r == 0 || n == r {1}
    else { combination(n-1, r-1) + combination(n-1, r) }
}