#include<bits/stdc++.h>
#define ll long long
#define db long double
#define mk make_pair
#define eb emplace_back 
#define fo(i,a,b) for(ll (i)=(a);(i)<=(b);(i)++)
#define fd(i,a,b) for(ll (i)=(a);(i)>=(b);(i)--)
using namespace std;
const int N=1e5+10;
const int mo=1e9+7;
ll n,ans;
string s[10];
int mp[10][10],vis[10];
void dfs(int x){
    if(ans==1) return ;
    if(x==7){
        ans=1;
        return ;
    }
    fo(i,1,6) {
        if(!vis[i] && mp[i][x]){
            vis[i]=1;
            dfs(x+1);
            if(ans==1) return ;
            vis[i]=0;
        }
    }
}
void solve(){
    fo(i,1,6) {
        cin>>s[i]; 
        vis[i]=0;
        fo(j,0,5) mp[i][j]=0;
        fo(j,0,s[i].length()-1) {
            if(s[i][j]=='h') mp[i][1]=1;
            if(s[i][j]=='a') mp[i][2]=1;
            if(s[i][j]=='r') mp[i][3]=1;
            if(s[i][j]=='b') mp[i][4]=1;
            if(s[i][j]=='i') mp[i][5]=1;
            if(s[i][j]=='n') mp[i][6]=1;
        } 
    }
    dfs(1);
    if(ans==1) cout<<"Yes\n";
    else cout<<"No\n";
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int T;
    cin>>T;
    while(T--) solve();
    return 0;
}