import java.io.*;
import java.util.*;
public class rrq3
{
    public static void main(String args[])throws IOException
    {
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();
        String sr[]=new String[n];
        for(int i=0;i<n;i++)
        sr[i]=in.next();
        char h[];
        h=new char[]{'h','a','c','k','e','r','r','a','n','k'};
        int l=h.length;
        for(int i=0;i<n;i++)
        {
            String s=sr[i];int q=0;
            int len=s.length();
            for(int j=0;j<len;j++)
            {
                //everytime we encounter a character part of "hackerrank" we increment q
                if(s.charAt(j)==h[q])
                {
                    q++;
                    if(q==l)
                    break;
                    //if q becomes equal to length then hackerrank can be formed from the given string.
                }
            }
            //if the hackerrank can be formed with given string
            if(q==l)
            System.out.println("YES");
            else
            System.out.println("NO");
        }    
        }
}