#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
#include<math.h>
#include<iomanip>
#include<set>
#include<numeric>
#include<cstring>
#include<cstdio>
#include<functional>
#include<bitset>
#include<limits.h>
#include<cassert>
#include<iterator>
#include<complex>
#include<stack>
#include<sstream>
using namespace std;
typedef  long long int lint;
typedef pair<int, int> IP;
typedef pair<lint, lint> LLP;
typedef pair<char, char>CP;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define sort(v) sort((v).begin(), (v).end())
#define reverse(v) reverse((v).begin(), (v).end())
#define upper(v,hoge) upper_bound(v.begin(),v.end(),hoge)
#define lower(v,hoge) lower_bound(v.begin(),v.end(),hoge)
#define llower(v,hoge) *lower_bound(v.begin(), v.end(), hoge)
#define lupper(v,hoge) *upper_bound(v.begin(), v.end(), hoge)



int main() {
	string S;
	cin >> S;
	int Z = S.size();
	string now;
	int cntc = 0;
	int cntw1 = 0;
	int cntw2 = 0;
	int ans = 1000;
	rep(i, Z) {
		rep(j, Z) {
			if (i + j + 1 <= Z) {
				now = S.substr(i, j + 1);
				cntc = 0;
				cntw1 = 0;
				cntw2 = 0;
				rep(k, now.size()) {
					if (now[k] == 'c'&&cntc==0) {
						cntc++;
					}
					else if (now[k] == 'w'&&cntc!=0&&cntw1==0) {
						cntw1++;
					}
					else if (now[k] == 'w' && cntc != 0 && cntw1 != 0&&cntw2==0) {
						cntw2++;
					}
				}
				if (cntc && cntw1 && cntw2) {
					ans = min(ans, j+1);
				}
			}
		}
	}
	if (ans == 1000) {
		cout << -1 << endl;
	}
	else {
		cout << ans << endl;
	}
}