/*
 *     Date:
 *        2015/07/25
 *     Author:
 *        Indestinee
 */
#include <cmath>
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int cas, n, m, dp[150][15][5][2];
char a[200], s[] = "1anniversary";
int main(){
//    freopen( "" , "r" , stdin );
//    freopen( "" , "w" , stdout );
    cin >> cas;
    a[0] = '1';
    m = strlen( s ) - 1;
    while( cas -- ){
        scanf( "%s" , a + 1 );
        n = strlen( a ) - 1;
        memset( dp , 0 , sizeof( dp ) );
        dp[0][0][0][0] = 1;
        for( int i = 1 ; i <= n ; i ++ ){
            for( int j = 0 ; j <= m ; j ++ )
                for( int k = 0 ; k < 4 ; k ++ ){    
                    if( a[i] == s[j+1] ){
                        dp[i][j+1][k+1][1] |= dp[i-1][j][k][0];
                        dp[i][j+1][k][1] |= dp[i-1][j][k][1];
                    }
                    dp[i][j][k][0] |= dp[i-1][j][k][0];
                    dp[i][j][k][0] |= dp[i-1][j][k][1];
                }
        }
/*
7
anniversary111
anniversaaaarrrry1123321
annivddfdersewwefary
21312312321321a3n22222niversary
a1n2n4iversary
nniversarya
*/
        int ans = 0;
        for( int i = 0 ; i < 4 ; i ++ )
            for( int st = 0 ; st < 2 ;  st ++ )
                ans |= dp[n][m][i][st];
        if( ans )
            puts( "YES" );
        else
            puts( "NO" );
    }
    return 0;
}