S = input()
N = len(S)
T = "yukicoder"
M = len(T)

res = []
for i in range(N-M+1):
    fg = True
    for j in range(M):
        if S[i+j] != T[j]:
            fg = False
            break
    if fg:
        res.append(i//9 + i%9)
ans = 0
c = 1
for i in range(len(res) - 1):
    if res[i+1] == res[i] + 1:
        c += 1
        ans = max(c, ans)
    else:
        c = 1
        
print(ans)