#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <stack>
#include <algorithm>
#include <string>
#include <map>
#include <iterator>
#include <set>
#include <queue>

using namespace std;

int main() {

    string S;
    cin >> S;
    int N = S.size();
    int m = N;
    bool found = false;
    for (int i = 0; i < N - 2; ++i) {
        for (int j = i+1; j < N - 1; ++j) {
            for (int k = j+1; k < N; ++k) {

                if (S[i] == 'c' and S[j] == 'w' and S[k] == 'w') {
                    found = true;
                    m = min(m, k - i + 1);
                }

            }
        }
    }

    if (found) {
        cout << m << endl;
    } else {
        cout << -1 << endl;
    }

    return 0;
}