#include <bits/stdc++.h>
using namespace std;

inline int lcs(string a, string b){
  int n = a.length();
  int m = b.length();
  int dp[n+1][m+1];
  for(int i = 0; i <= n; i += 1){
    for(int j = 0; j <= m; j += 1){
      if(i == 0 or j == 0) dp[i][j] = 0;
      else{
        if(a[i-1] == b[j-1]){
          dp[i][j] = dp[i-1][j-1] + 1;
        }else{
          dp[i][j] = max(dp[i-1][j], dp[i][j-1]);
        }
      }
    }
  }
  return dp[n][m];
}


int main(void){
  string a = "hackerrank";
  int n;
  cin >> n;
  string b;
  while(n--){
    cin >> b;
    if(lcs(a, b) == a.length()){
      cout << "YES" << endl;
    }else{
      cout << "NO" << endl;
    }
  }
}