S = input()
T = "kadomatsu"
N = len(S)
M = len(T)
dp = [[0] * (M + 1) for i in range(N + 1)]

for i in range(N):
    for j in range(M):
        if S[i] == T[j]:
            dp[i + 1][j + 1] = max(dp[i][j] + 1, dp[i + 1][j + 1])
        else:
            dp[i + 1][j + 1] = max(dp[i][j + 1], dp[i + 1][j])
            
if dp[-1][-1] == N:
    print("Yes")
else:
    print("No")