#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, ans=0, cnt=0;
    string S;
    cin >> S;
    N = S.size();

    for (int i=0; i<9; i++){
        cnt = 0;
        for (int j=i; j<N; j+=9){
            if (S.substr(j, 9) == "yukicoder") cnt++;
            else cnt=0;
            ans = max(ans, cnt);
        }
    }
    cout << ans << endl;

    return 0;
}