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) { final String OP = "hackerrank"; Scanner in = new Scanner(System.in); int q = in.nextInt(); List list = new ArrayList<>(); for (int a0 = 0; a0 < q; a0++) { String check = in.next(); boolean found = false; if (check.indexOf('h') > -1) { check = check.substring(check.indexOf('h') + 1, check.length()); if (check.indexOf('a') > -1) { check = check.substring(check.indexOf('a') + 1, check.length()); if (check.indexOf('c') > -1) { check = check.substring(check.indexOf('c') + 1, check.length()); if (check.indexOf('k') > -1) { check = check.substring(check.indexOf('k') + 1, check.length()); if (check.indexOf('e') > -1) { check = check.substring(check.indexOf('e') + 1, check.length()); if (check.indexOf('r') > -1) { check = check.substring(check.indexOf('r') + 1, check.length()); if (check.indexOf('r') > -1) { check = check.substring(check.indexOf('r') + 1, check.length()); if (check.indexOf('a') > -1) { check = check.substring(check.indexOf('a') + 1, check.length()); if (check.indexOf('n') > -1) { check = check.substring(check.indexOf('n') + 1, check.length()); if (check.indexOf('k') > -1) { found = true; } } } } } } } } } } if (found) { System.out.println("YES"); } else { System.out.println("NO"); } } } }