#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long ll; typedef vector vi; typedef pair pii; #define fst first #define scd second #define PB push_back #define MP make_pair #define rep(i,x) for(int i=0;i<(x);++i) #define rep1(i,x) for(int i=1;i<=(x);++i) #define rrep(i,x) for(int i=(x)-1;i>=0;--i) #define rrep1(i,x) for(int i=(x);i>=1;--i) #define FOR(i,a,x) for(int i=(a);i<(x);++i) #define all(a) a.begin(),a.end() #define rall(a) a.rbegin(),a.rend() templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(a>b){a=b;return true;}return false;} templateT get(){T a;cin>>a;return a;} templateT rev(T a){reverse(all(a));return a;} templateistream&operator>>(istream&is,vector&vec){rep(i,vec.size())is>>vec[i];return is;} templatevector&sort(vector&a){sort(all(a));return a;} const int inf = 1e9; const ll linf = 3e18; signed main() { string s; cin >> s; int mi = 100; rep(i, s.size()) rep(j, i) rep(k, j) { if (s[k] == 'c' && s[j] == 'w' && s[i] == 'w') chmin(mi, i - k + 1); } cout << (mi == inf ? -1 : mi) << endl; }