import java.util.Arrays;
import java.util.Scanner;

/**
 * Created by aayush on 10-02-2017.
 */
public class Solution {
    public static void main(String[] args)
    {
        Scanner in=new Scanner(System.in);
        int T=in.nextInt();


        while(--T>=0)
        {
            String xx="";

            String str=in.next();
            char arr[]=str.toCharArray();

            char arr2[]=new char[10];

            int visited[]=new int[10];
            Arrays.fill(visited,0);
            int a=-1;

            for(int i=0;i<arr.length;i++)
            {
                //now check the sequence order of indices
                if(arr[i]=='h') {

                    if (visited[0] != 1 ) {
                      //  xx+=arr[i];
                        a=i;
                        arr2[0]=arr[i];
                        visited[0]=1;

                    }
                }
                if(arr[i]=='a' )
                {
                    if(visited[1]!=1 && visited[0]==1)
                    {


                        arr2[1]=arr[i];
                        visited[1]=1;
                    }
                    if(visited[7]!=1 && visited[6]==1 )
                    {
                       // xx+=arr[i];


                        arr2[7]=arr[i];
                        visited[7]=1;
                    }
                }
                if(arr[i]=='c')
                {
                    if(visited[2]!=1 && visited[1]==1)
                    {
                       // xx+=arr[i];

                        arr2[2]=arr[i];
                        visited[2]=1;
                    }
                }
                if(arr[i]=='k')
                {
                    if(visited[3]!=1 && visited[2]==1)
                    {
                       // xx+=arr[i];

                        arr2[3]=arr[i];
                        visited[3]=1;
                    }
                   else if(visited[9]!=1 && visited[8]==1)
                    {
                        //xx+=arr[i];

                        arr2[9]=arr[i];
                        visited[9]=1;
                    }
                }
                if(arr[i]=='e')
                {
                    if(visited[4]!=1 && visited[3]==1)
                    {
                       // xx+=arr[i];
                        a=i;
                        arr2[4]=arr[i];
                        visited[4]=1;
                    }
                }
                if(arr[i]=='r')
                {
                    if(visited[5]!=1 && visited[4]==1)
                    {
                       // xx+=arr[i];

                        arr2[5]=arr[i];
                        visited[5]=1;
                    }
                    else if(visited[6]!=1 && visited[5]==1)
                    {
                        //xx+=arr[i];
                        arr2[6]=arr[i];
                        visited[6]=1;
                    }
                }
                if(arr[i]=='n' )
                {
                    if(visited[8]!=1 && visited[7]==1)
                    {
                       // xx+=arr[i];

                        arr2[8]=arr[i];
                        visited[8]=1;
                    }
                }

            }
            for(int i=0;i<arr2.length;i++)
            {
                xx+=arr2[i];
            }
           // System.out.println("xx:"+xx);

            if(xx.equals("hackerrank"))
            {
                System.out.println("YES");
            }
            else
            {
                System.out.println("NO");
            }

        }
    }
}