#include<stdio.h>

int main()
{
	int test,i,j,l=0,f=0,o;
	char que[10005],res[10]={'\0'};//final[10] ={'h','a','c','k','e','r','r','a','n','k'};
	scanf("%d",&test);
	for(i=0;i<test;i++)
	{
		scanf("%s",que);
		for(j=0;que[j] != '\0';j++)
		{
			if((que[j] == 'h') && (res[0] != 'h'))
			{
				res[f] = que[j];
                f++;
				continue;
			}
			
			if((res[f-1] == 'h') && (res[1] != 'a'))
			{
				if(que[j] == 'a'){
					res[f] = que[j]; 
                    f++;}
				continue;
			}
			
			if((res[f-1] == 'a') && (res[2] != 'c'))
			{
				if(que[j] == 'c'){
					res[f] = que[j];
                f++;}
				continue;				
			}
			
			if((res[f-1] == 'c') && (res[3] != 'k'))
			{
				if(que[j] == 'k'){
					res[f] = que[j];
                    f++;}
					continue;
			}
			
			if((res[f-1] == 'k') && (res[4] != 'e'))
			{
				if(que[j] == 'e'){
					res[f] = que[j];
                    f++;}
				continue;
			}
			
			if((res[f-1] == 'e') && (res[5] != 'r'))
			{
				if(que[j] == 'r'){
					res[f] = que[j];
                    f++;}
			continue;
			}
			
			if((res[f-1] == 'r') && (res[6] != 'r'))
			{
				if(que[j] == 'r'){
					res[f] = que[j];
                    f++;}
			continue;
			}
			
			if((res[f-1] == 'r') && (res[7] != 'a'))
			{
				if(que[j] == 'a'){
					res[f] = que[j];
                    f++;}
			continue;
			}
			
			if((res[f-1] == 'a') && (res[8] != 'n'))
			{
				if(que[j] == 'n'){
					res[f] = que[j];
                    f++;}
			
			continue;
            }
			
			if((res[f-1] == 'n') && (res[9] != 'k'))
			{
				if(que[j] == 'k')
				{
				res[f] = que[j];
				l = 1;
                    break;
				}
				
				
			}
			//if(l == 1)
			//	break;
		}
        f=0;
		if(l == 1){
            printf("YES\n");
       // printf("%s\n",res);
        }
		else
        {
			printf("NO\n");
           //printf("%s\n",res);
        }
        for(o=0;o<10;o++)
            res[o] = '\0';
        l=0;
	}
return 0;	
}