#include <iostream>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define vi vector<int>

int main() {
    string s;
    cin >> s;
    int min_len = 255;
    for(int i = 0; i < s.length(); ++i) {
        if (s[i] != 'c') {
            continue;
        }
        for(int j = i+1; j < s.length(); ++j) {
            if (s[j] != 'w') {
                continue;
            }
            for(int k = j+1; k < s.length(); ++k) {
                if (s[k] == 'w') {
                    int len = (j-i+1)+(k-j);
                    if (min_len > len) {
                        min_len = len;
                    }
                }
            }
        }
    }
    if (min_len == 255) {
        cout << -1 << endl;
    } else {
        cout << min_len << endl;
    }
}