#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define p(s) cout<<(s)<<endl
#define REP(i,n,N) for(int i=n;i<N;i++)
#define RREP(i,n,N) for(int i=N-1;i>=n;i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define F first
#define S second
typedef long long ll;
using namespace std;
const int inf = 1e9+7;

string s;
int ans;
int main() {
    cin>>s;
    int N=s.size();
    ans = N;
    REP(i,0,N){
        if(s[i]=='w'){
            ans = N-i;
            break;
        }
    }
    bool flag=false;
    RREP(i,0,N){
        if(s[i]=='c'&&flag){
            ans = min(ans, i+1);
            break;
        }else if(s[i]=='c'){
            flag=true;
        }

    }
    p(ans);
    return 0;
}