#include <bits/stdc++.h>
using namespace std;

int main(){
    string s;
    cin >> s;

    //一番右のcを探す
    int last_c = s.size();
    int loop = 0;
    int size = s.size();
    int res[100] = {0};

    while(1){
        int count_w = 0;
        for(int i = 0; i < size; i++){
             if(s[i] == 'c'){
                last_c = i;
            }
        }

        size = last_c;
        //一番右のcからwが二つ目まで探す
        for(int i = last_c; i < s.size(); i++){
            if(s[i] == 'w'){
                count_w++;
            }
            if(count_w == 2){
                res[i] = i-last_c+1;
            }
        }

        loop++;
        if(loop > 100) break;
    }
    
   sort(res, res + 100, greater<>());
   if(res[0] < 3) cout << -1 << endl;
   else cout << res[0] << endl; 
}