#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
 
#define NYAN ios::sync_with_stdio(false);cin.tie(nullptr);cout<<fixed<<setprecision(15);
typedef long long ll;
typedef long double ld;
typedef __int128_t i128;
template<class T> using pq = priority_queue<T>;
template<class T> using pqg = priority_queue<T, vector<T>, greater<T>>;
template<class T> using v = vector<T>;
#define pl pair<ll, ll>
#define vl v<ll>
#define vp v<pl>
#define vm v<mint>
 
void Yes(bool b=1) { cout << (b==1?"Yes":"No") << "\n"; }
void YES(bool b=1) { cout << (b==1?"YES":"NO") << "\n"; }
void No(bool b=1) { cout << (b==1?"No":"Yes") << "\n"; }
void NO(bool b=1) { cout << (b==1?"NO":"YES") << "\n"; }
void CIN() {}
template <typename T, class... U> void CIN(T &t, U &...u) { cin >> t; CIN(u...); }
void COUT() { cout << "\n"; }
template <typename T, class... U, char sep = ' '> void COUT(const T &t, const U &...u) { cout << t; if (sizeof...(u)) cout << sep; COUT(u...); }
#define dump(x) cerr << #x << ":"<< x << "\n";
#define vdump(x) rep(repeat, sz(x)) cerr << repeat << ":" << x[repeat] << "\n";
 
#define bp __builtin_popcountll
#define ALL(x) x.begin(),x.end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define reps(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define sz(x) (ll)x.size()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
 
long double PI = 3.14159265358979;
#define INF32 2147483647
#define INF64 9223372036854775807
// using mint = modint998244353;
using mint = modint1000000007;
//右下左上 右下 左下 左上 右上
ll xd[]={0,1,0,-1,1,1,-1,-1};
ll yd[]={1,0,-1,0,1,-1,-1,1};
ll rmax(ll a, ll b){return max(a, b);}
ll rmin(ll a, ll b){return min(a, b);}
ll rsum(ll a, ll b){return a + b;}
ll rzero(){return 0;}


/* SOLVE BEGIN ************************************************************************** */

void solve()
{
  string s;
  cin >> s;
  string t = "yukicoder";
  
  ll ans = 0, sum = 0;
  rep(i, sz(s)){
    string now = "";
    reps(j, i, min(sz(s), sz(t) + i)) now += s[j];
    if(now == t){
      sum++;
      chmax(ans, sum);
      i += sz(t) - 1;
    }else{
      sum = 0;
    }
  }
  cout << ans << "\n";
}

int main()
{
  NYAN
  solve();
  return 0;
}