#include #include #include #include #include #include #include #include #include #include #include #include using namespace std; char s[1000]; const char key[] = "anniversary"; int beg; int len; bool judge(int f, int e) { //cout << "##" << f << " " << e << endl; if(beg >= len) return false; for(int i = beg; i < len; ++i) { int k = 0; for(k = 0; k < (e-f+1); ++k) { if(i+k >= len) return false; if(key[f+k] == s[i+k]); else { break; } } if(k == e-f+1) { beg = i+k; //cout << e << " " << f << " " << k << " " << beg << endl; //cout << f << " " << beg << endl; return true; } } return false; } bool solve() { int key_len = strlen(key); len = strlen(s); for(int i = 1; i < key_len; ++i) { for(int j = i+1; j < key_len; ++j) { beg = 0; if(judge(0, i-1) && judge(i, j-1) && judge(j, key_len-1)) { return true; } } } return false; } int main() { //freopen("out", "w", stdout); //freopen("in", "r", stdin); int cases; scanf("%d", &cases); while(cases--) { scanf("%s", s); if(solve()) puts("YES"); else puts("NO"); } return 0; }