#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <set>

using namespace::std;




int main() {
  ios::sync_with_stdio(false);
  string s, p = "yukicoder";
  cin >> s;
  int r = 0;
  for (int i = 0; i < s.size();) {
    // cerr << "r = " << r << " i = " << i << " " << s.substr(i) << endl;
    int j = 0;
    for (; i + j < s.size() && s[i + j] == p[j % p.size()]; ++j);
    r = max<int>(r, j / p.size());
    i += max(1, j);
  }
  
  cout << r << endl;

  
  return 0;
}