import std.algorithm,
       std.string,
       std.range,
       std.stdio,
       std.conv;

ulong factorial(ulong n) {
  ulong t = 1;

  for (ulong i; i < n; i++)
    t *= (n - i);

  return t;
}

ulong p(ulong n, ulong r) {
  ulong t = 1;

  for (ulong i; i < r; i++)
    t *= (n - i);

  return t;
}

ulong c(ulong n, ulong r) {
  return p(n, r) / r.factorial; 
}

void main() {
  dchar[] cwws;
  size_t idx;
  size_t count;

  foreach (c; readln.chomp.split(string.init).to!(dchar[])) {
    if (c == 'c' || c == 'w') {
      cwws ~= c;
    }
  }

  foreach (c; cwws) {
    if (cwws.length - 2 < idx) {
      break;
    }

    if (c == 'c') {
      ulong ws;
      foreach (w; cwws[(idx + 1)..$]) 
        if (w == 'w')
          ws++;

      if (1 < ws) {
        count += ws.c(2);
      } else {
        break;
      }
    }

    idx++;
  }

  writeln(count);
}