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):
    DP[i+1][j+1]=max(DP[i][j+1],DP[i+1][j])
    if S[i]==T[j]:
      DP[i+1][j+1]=max(DP[i+1][j+1],DP[i][j]+1)
print('YNeos'[DP[N][M]!=N::2])