#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < int(n); i++)
#define rrep(i,n) for(int i = int(n)-1; i >= 0; i--)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
int dx[] = {1, 0,-1, 0, 1, 1,-1,-1};
int dy[] = {0, 1, 0,-1, 1,-1, 1,-1};
ll mod = 998244353;
ll MOD = 1000000007;
int inf = 1001001001;
ll INF = 1001001001001001001;
int dp[15][15];
int main() {
    string S;
    cin >> S;
    string T = "kadomatsu";
    int mx = 0;
    rep(i,S.size()) {
        rep(j,T.size()) {
            if(S[i] == T[j]) {
                dp[i+1][j+1] = max(dp[i+1][j+1],dp[i][j]+1);
            }
            dp[i][j+1] = max(dp[i][j+1],dp[i][j]);
            dp[i+1][j] = max(dp[i+1][j],dp[i][j]);
            mx = max(mx,dp[i+1][j+1]);
            mx = max(mx,dp[i+1][j]);
            mx = max(mx,dp[i][j+1]);
        }
    }
    if(mx == S.size()) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl; 
    }
}