#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <string>
#include <queue>
#include <map>
#include <bitset>
#include <set>
#include <stack>
#include <numeric>
#include <unordered_map>
#include <random>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vd = vector<double>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
const int inf = (1 << 30) - 1;
const ll INF = 1LL << 60;
const int MOD = 1000000007;
//const int MOD = 998244353;

int main() {
	string s;
	cin >> s;
	string t = "yukicoder";
	int ans = 0;
	string tmp = "";
	for (int i = 0; i < s.length() - 8; i++) {
		if (s[i] == 'y') {
			bool ok = true;
			for (int j = 1; j < 9; j++) {
				if (s[i + j] != t[j]) {
					ok = false;
					tmp += 'y';
					break;
				};
			}
			if (ok) {
				tmp += '0';
				i += 8;
			}
		}
		else {
			tmp += s[i];
		}
	}
	int cnt = 0;
	for (int i = 0; i < tmp.length(); i++) {
		if (tmp[i] == '0') cnt++;
		else {
			ans = max(ans, cnt);
			cnt = 0;
		}
	}
	ans = max(ans, cnt);
	cout << ans << endl;

	return 0;
}