import java.util.HashSet;
import java.util.Scanner;

public class Solution {

    public static final char[] HACKER_RANK = { 'h', 'a', 'c', 'k', 'e', 'r', 'r', 'a', 'n', 'k' };
    public static final char[] HACKE_ANK = { 'h', 'a', 'c', 'k', 'e', 'r', 'a', 'n', 'k' };

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int q = in.nextInt();
        for(int a0 = 0; a0 < q; a0++){
            String s = in.next();
            System.out.println(solve(s));
        }
    }

    public static String solve(String str) {
        if(str.length() < 10) return "NO";
        HashSet<Character> set = new HashSet<Character>();
        char[] arr = str.toCharArray();
        for(char ch : arr) {
            set.add(ch);
        }
        for(char ch : HACKE_ANK) {
            if(!set.contains(ch)) return "NO";
        }
        if(!set.contains('r')) return "NO";
        int count = 0;
        for(char ch : arr) {
            if(ch == 'r') count++;
            if(count == 2) break;
        }
        return count == 2 ? "YES" : "NO";
    }
}