import sys
import math
import collections
import bisect


# sys.setrecursionlimit(10000001)
INF = 10 ** 20
# MOD = 10 ** 9 + 7
MOD = 998244353


def ni(): return int(sys.stdin.buffer.readline())
def ns(): return map(int, sys.stdin.buffer.readline().split())
def na(): return list(map(int, sys.stdin.buffer.readline().split()))
def na1(): return list(map(lambda x: int(x)-1, sys.stdin.buffer.readline().split()))


# ===CODE===

def main():
    s = list(input())
    k = "kadomatsu"

    idx = -1
    for si in s:
        idx += 1
        if idx == len(k):
            print("No")
            return
        while si != k[idx]:
            idx += 1
            if idx == len(k):
                print("No")
                return
    print("Yes")


if __name__ == '__main__':
    main()