import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int q = in.nextInt();
        String s1 = "hackerrank";
        char[] ch1 = s1.toCharArray();
        int m = s1.length();
        for(int a0 = 0; a0 < q; a0++){
            
            String s = in.next();
            int n = s.length();
            char[] ch2 = s.toCharArray(); 
            boolean a =isSubSequence(ch1,ch2,m,n);
            
            if(a)
                System.out.println("YES");
            else
                System.out.println("NO");
            
            
            
        }
    }
    
    public static boolean isSubSequence(char[] str1,char[] str2 ,int m,int n)
        {
        int j=0;
        
        for(int i=0;i<n&&j<m;i++)
            {
              if(str1[j]== str2[i])
                  j++;
        }
        return (j==m);
    }
}