#include #define rep(i,n) for(int i = 0; i < (n); ++i) #define srep(i,s,t) for (int i = s; i < t; ++i) #define drep(i,n) for(int i = (n)-1; i >= 0; --i) using namespace std; typedef long long int ll; typedef pair P; #define yn {puts("YES");}else{puts("NO");} #define MAX_N 200005 int main() { string s; cin >> s; string t = "kadomatsu"; int n = 9; rep(i,1< bi(i); string tt; rep(j,n){ if(bi[j]) tt += t[j]; } if(tt == s){ cout << "Yes" << endl; return 0; } } cout << "No" << endl; return 0; }