#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define clc(arr, val)    memset(arr, val, sizeof(arr))
#define FOR(i,a,b)  for(int i=a;i<=b;i++)
#define IN   freopen ("in.txt" , "r" , stdin);
#define OUT  freopen ("out.txt" , "w" , stdout);
typedef long long  LL;
typedef unsigned long long  ULL;
const int MAXN = 600127;
const int MAXM = 6000010;
const int N = 30127;
const int M = 200000;
const int INF = 0x3f3f3f3f;
const LL mod = (LL)1<<32;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
string s,ans="anniversary";
int solve()
{
    string a,b,c;
    int flag=0;
    for(int i=1; i<=11; i++)
    {
        for(int j=1; j<=11; j++)
        {
            if(i+j>=11) continue;
            int k=11-i-j;
//            cout<<i<<" "<<j<<" "<<k<<endl;
            a=ans.substr(0,i);
            b=ans.substr(i,j);
            c=ans.substr(i+j,k);
//            cout<<a<<" "<<b<<" "<<c<<endl;
            int x=s.find(a);
            if(x==-1) continue;
            string aa=s.substr(x+i);
            int y=aa.find(b);
            if(y==-1) continue;
            aa=aa.substr(y+j);
            int z=aa.find(c);
            if(z==-1) continue;
            return 1;
        }
    }
    return 0;
}
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        cin>>s;

        if(solve()) puts("YES");
        else puts("NO");
    }
    return 0;
}