#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <ostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
#define INF 1000000000
#define rep(i,a,b) for (int i=(a);i<(b);i++)
#define rev(i,a,b) for (int i=(a)-1;i>=b;i--)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef queue<int> qi;
typedef vector<int> vi;
typedef vector<string> vs;
int dx[4] = { 0, 1, 0, -1 };
int dy[4] = { 1, 0, -1, 0 };

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);

  string s;
  cin >> s;
  int ans = 0;
  rep(i,0,s.size()) {
    if(s[i] == 'c') {
      int w_num = 0;
      rep(j,i,s.size()) if(s[j] == 'w') w_num++;
      // 1 3 6 10 15 21
      if(w_num < 2) continue;
      int cww_num = 1;
      rep(j,2, w_num) cww_num += j;
      ans += cww_num;
    }
  }
  cout << ans << endl;
	return 0;
}