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 = s.toCharArray();
            Queue<Character> hrank = new LinkedList<Character>(); 
            hrank.add('h');
            hrank.add('a');
            hrank.add('c');
            hrank.add('k');
            hrank.add('e');
            hrank.add('r');
            hrank.add('r');
            hrank.add('a');
            hrank.add('n');
            hrank.add('k');
            //Character currentOk = hrank.peek();
            boolean hasStr = false;
        	Character hrankChar = hrank.poll();

            for(char c : chars){
            	
            	if(c == hrankChar){
            		//System.out.println(c + " is char we are looking for "+ hrankChar);
            		hrankChar = hrank.poll();
            		if(hrankChar ==null){
            			hasStr = true;
            			break;
            		}
            	} else{
            		//System.out.println(c + " is NOT char we are looking for "+ hrankChar);
            	}
           
            }
            
            
            
            if(hasStr == true){
            	System.out.println("YES");
            }else{
            	System.out.println("NO");
            }
      
            
        }
    }
}