import sys
from collections import defaultdict, Counter, deque
from itertools import permutations, combinations, product, combinations_with_replacement, groupby, accumulate
import operator
#from math import sqrt,isqrt
#from bisect import bisect_left,bisect_right
#from functools import lru_cache,reduce
#import heapq
#import numpy as np
#import networkx as nx
# from numba import njit, b1, i1, i4, i8, f8
# numba例 @njit(i1(i4[:], i8[:, :]),cache=True) 引数i4配列、i8 2次元配列,戻り値i1
def input(): return sys.stdin.readline().rstrip()
def divceil(n, k): return 1+(n-1)//k  # n/kの切り上げを返す


def check(a):
    return len(set(a)) == 3 and a[1] in [max(a), min(a)]


def main():
    mod = 10**9+7
    mod2 = 998244353
    s = list(input())
    kado = list('kadomatsu')
    for bit in product((0, 1), repeat=9):
        ss = []
        for i in range(9):
            if bit[i]:
                ss.append(kado[i])
        if s == ss:
            print('Yes')
            break
    else:
        print('No')


if __name__ == '__main__':
    main()