#include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <cstring>
#include <cctype>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <list>
#include <stdio.h>
#include <string.h>
#include <cstdlib>
#include <math.h>
#include <bitset>
#include <iterator>
#include <iomanip>
#include <sstream>
#define INF 2000000000
using namespace std;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
#define sym cout<<"---------"<<endl;
#define ll long long
#define PL pair<long long, long long>
#define P pair<int,int>
#define mk make_pair
#define en endl
#define WHITE 0
#define BLACK 2
#define GRAY 1
#define RE return 0
#define int ll

#define c 1
#define w 0
vector<P> ve;

signed main(){
  string s;
  cin>>s;
  for(int i=0; i<s.size(); i++){
    if(s[i]=='c') ve.push_back(mk(i,c));
    else if(s[i]=='w') ve.push_back(mk(i,w));
  }
  
  int minl=INF;
  for(int i=0; i<ve.size(); i++){
    if(ve[i].second==c){
      int there=0;
      for(int j=i; j<ve.size(); j++){
        if(ve[j].second==w) there++;
        if(there==2){
          minl=min(minl,ve[j].first-ve[i].first+1);
        }
      }
    }
  }
  if(minl!=INF) cout<<minl<<en;
  else cout<<-1<<en;
}