#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>
#include <limits>
#include <array>

static const int MOD = 998244353;
using ll = long long;
using uint = unsigned;
using ull = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    string s;
    cin >> s;
    string t = "kadomatsu";
    int cur = 0;
    for (auto &&i: t) {
        if(cur < s.size() && i == s[cur]) {
            cur++;
        }
    }
    if(cur == s.size()) puts("Yes");
    else puts("No");
    return 0;
}