#include<bits/stdc++.h>
#define assn(n,a,b) assert(n<=b && n>=a)
using namespace std;
#define pb push_back
#define mp make_pair
#define clr(x) x.clear()
#define sz(x) ((int)(x).size())
#define F first
#define S second
#define REP(i,a,b) for(i=a;i<b;i++)
#define rep(i,b) for(i=0;i<b;i++)
#define rep1(i,b) for(i=1;i<=b;i++)
#define pdn(n) printf("%d\n",n)
#define sl(n) scanf("%lld",&n)
#define sd(n) scanf("%d",&n)
#define pn printf("\n")
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef long long LL;
#define MOD 1000000007
LL mpow(LL a, LL n)
{LL ret=1;LL b=a;while(n) {if(n&1)
    ret=(ret*b)%MOD;b=(b*b)%MOD;n>>=1;}
return (LL)ret;}
#define MAXK 100005
#define MAXN 1000000000
int ar[MAXK];
int get(int n, int k){
    int i=0;
    while(i<k and ar[i]<=n)i++;
    return n-i;
}
typedef unsigned long long ULL;

bool is_subseq(string to_find, string s, int m, int l)
{
    if(m==0) return true;
    if(l == 0) return false;
    if(to_find[m-1] == s[l-1]) return is_subseq(to_find,s,m-1,l-1);
    return is_subseq(to_find,s,m,l-1);
}

int main()
{
    int n;sd(n);
    int i;
    int m,l;
    string s;
    string to_find = "hackerrank";
    m = to_find.length();
    rep(i,n)
    {
        cin>>s;
        l = s.length();
        if(is_subseq(to_find,s,m,l) )
        {
            cout<<"YES"<<endl;
        }else cout<<"NO"<<endl;
    }
    return 0;
}