#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
    string s; cin>>s;
    string t="kadomatsu";
    int m=s.size();
    int n=t.size();
    for(int i=0; i<(1<<n); i++){
        if(popcount(i)!=m) continue;
        int k=0;
        bool dame=0;
        for(int j=0; j<n; j++){
            if(!(i&(1<<j))) continue;
            if(s[k]!=t[j]){
                dame=1;
            }
            k++;
        }
        if(!dame){
            cout<<"Yes"<<endl;
            return 0;
        }
    }
    cout<<"No"<<endl;
    return 0;
}