#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<cstdio>
#include<cstring>
#include<string>
#include<cctype>
#include<cstdlib>
#include<algorithm>
#include<bitset>
#include<vector>
#include<list>
#include<deque>
#include<queue>
#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<sstream>
#include<fstream>
#include<iomanip>
#include<ctime>
#include<complex>
#include<functional>
#include<climits>
#include<cassert>
#include<iterator>
using namespace std;

string s;


string f = "cww";


#define MAX 100002
bool use[MAX][4];
long long int dp[MAX][4];

char buf[MAX];


int n;

inline long long int dfs(int a, int b){
	if (use[a][b]){
		return dp[a][b];
	}
	if (b == 3){
		return 1;
	}
	if (a == n){
		return 0;
	}
	use[a][b] = true;
	if (f[b] == s[a]){
		dp[a][b] = dfs(a + 1, b + 1);
	}
	dp[a][b] += dfs(a + 1, b);
	return dp[a][b];
}
int main(){
	scanf("%s", buf);
	s = buf;
	n = s.size();
	long long int ans = dfs(0, 0);
	printf("%lld\n", ans);
	return 0;
}