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();
        for(int a0 = 0; a0 < q; a0++){
            String s = in.next();
            char chars [] = {'h', 'a', 'c', 'k', 'e', 'r', 'r', 'a', 'n', 'k'};
            int  indexOfChars [] = new int [10];
            boolean isValid = true;
            int i = 0,k=0;
            for(char c : chars){
              if(s.indexOf(c) >= 0){
                  indexOfChars[i] = s.indexOf(c,k);
                  k = indexOfChars[i]+1;
                  i++;
                  
              }
              else{
                  isValid = false;
                  break;
              }  
            }
            //System.out.println(Arrays.toString(indexOfChars));
            if(isValid){
                boolean isInAscending = true;
                for(int j = 0; j < indexOfChars.length-1; j++){
                    if(!(indexOfChars[j] < indexOfChars[j+1])){
                        isInAscending = false;
                        break;
                    }
                }
                System.out.println((isInAscending)? "YES" : "NO");
            }
            else
                System.out.println("NO");
            
            
            
    }
    }
}