#include <iostream>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <climits>
#include <ctime>
#include <cassert>
#include <cctype>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <vector>
#include <bitset>

#define X first
#define Y second
#define pb push_back
#define bit(x) (1 << (x))
#define bnum(x) (__builtin_popcount(x))
#define all(x) (x).begin(), (x).end()
#define mset0(x) memset((x), 0, sizeof((x)))
#define mset1(x) memset((x), -1, sizeof((x)))
#define LET(x,a) __typeof(a) x(a)
#define REP(it,v) for (LET(it,v.begin()); it != v.end(); it++)
#define sz(x) ((int)(x.size()))
#define PQ priority_queue
#define sqr(x) ((x) * (x))

using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;

template <class T> inline void chkmin(T &a, T b) {
    if (b < a) a = b;
}
template <class T> inline void chkmax(T &a, T b) {
    if (a < b) a = b;
}

const int MX = 100005;
char pat[] = "anniversary";
char s[MX];

int main() {
    
    int n = strlen(pat);
    int T, i, j, k;
    
    for (scanf("%d", &T); T--; ) {
        scanf("%s", s);
        int m = strlen(s);
        
        for (i = 0; i < n; i++) {
            for (j = i + 1; j < n - 1; j++) {
            
                int cur = 0;
                for (int k = 0; k < m; k++) {
                    if (cur == 0) {
                        if (!strncmp(pat, s + k, i + 1)) {
                            cur = 1;
                            k += i;
                        }
                        
                    } else if (cur == 1) {
                        if (!strncmp(pat + i + 1, s + k, j - i)) {
                            cur = 2;
                            k += j - i - 1;
                        }
                    } else if (cur == 2) {
                        if (!strncmp(pat + j + 1, s + k, n - 1 - j)) {
                            cur = 3;
                        }
                    }
                }
                
                if (cur == 3) break;
            }
            if (j < n - 1) break;
        }
        
        if (i < n) puts("YES");
        else puts("NO");
    }
    
    return 0;
}