//moshasu

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
vector<char> x{'y','u','k','i','c','o','d','e','r'};
int main() {
    string S; cin >> S;
    int y = 0;
    int ans = 0;
    bool fire = false;
    vector<int> Z;
    for(int i = 0; i < S.size(); i++) {
        if(x[y] == S[i]) {
            y++;
        }else {
            y = 0;
            fire = false;
        }
       if(y== 9){
           ans++;
           y = 0;
           fire = true;
       }
        if(ans > 0 && fire == false) {
            Z.push_back(ans);
            ans = 0;
        }
    }
    Z.push_back(ans);
    
    for(int i = 0; i < Z.size(); i++) {
       ans = max(ans,Z[i]);
    }
    cout << ans << endl;
}