#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;

typedef long long ll;

ll mod_pow(ll x, ll n, ll mod) {
    ll res = 1;
    while (n > 0) {
        if (n & 1) res = res * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return res;
}

int main() {
    string S, T = "kadomatsu";
    cin >> S;
    int l = S.size(), i = 0, j = 0;
    while (i < l && j < 9) {
        if (S[i] == T[j]) {
            i++;
            j++;
            continue;
        }
        j++;
    }
    if (i == l) cout << "Yes\n";
    else cout << "No\n";
}