#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;
    bool found = false;
    int tmpC=0;
    int ans = S.size();
    for (int i = 0; i < S.size() - 2; ++i) {
        if (S[i] == 'c') {
            tmpC = i;
            int cnt = 0;
            for (int j = i + 1; j < S.size(); ++j) {
                if (S[j] == 'w') {
                    cnt += 1;
                    if (cnt == 2) {
                        found = true;
                        ans = min(ans,j - tmpC + 1);
                        break;
                    }
                }
            }
        }
    }

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

    return 0;
}