#include<cstdio>

 #include<iostream>

 #include<algorithm>

 #include<cstring>

 #include<cmath>

 #include<queue>

 #include<map>

 using namespace std;

 #define MOD 1000000007

 const int INF=0x3f3f3f3f;

 const double eps=1e-;

 typedef long long ll;

 #define cl(a) memset(a,0,sizeof(a))

 #define ts printf("*****\n");

 const int MAXN=;

 int n,m,tt;

 char s[];

 char s1[]={'w','y','h'};

 int main()

 {

     int i,j,k;

     #ifndef ONLINE_JUDGE

     freopen("1.in","r",stdin);

     #endif

     scanf("%d",&tt);

     while(tt--)

     {

         scanf("%s",&s);

         int len=strlen(s);

         int tot=;

         for(i=;i<len;i++)

         {

             if(s[i]==s[i+]&&s[i]=='v')

             {

                 s[i]='w';

             }

             if(s[i]==s1[tot])

             {

                 tot++;

             }

         }

         if(tot==)

         {

             printf("Yes\n");

         }

         else printf("No\n");

     }

 }