#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <iostream>
#include <algorithm>
#include <sstream>
#include <cmath>
using namespace std;
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#define clc(arr, val)    memset(arr, val, sizeof(arr))
#define FOR(i,a,b)  for(int i=a;i<=b;i++)
#define IN   freopen ("in.txt" , "r" , stdin);
#define OUT  freopen ("out.txt" , "w" , stdout);
typedef long long  LL;
typedef unsigned long long  ULL;
const int MAXN = 600127;
const int MAXM = 6000010;
const int N = 30127;
const int M = 200000;
const int INF = 0x3f3f3f3f;
const LL mod = (LL)1<<32;
const double eps= 1e-8;
const double pi=acos(-1.0);
#define lson l,m, rt<<1
#define rson m+1,r,rt<<1|1
char s[123456],c[123456];
int main()
{
    int n,t;
    cin>>t;
    while(t--)
    {
        scanf("%s",s);
        int len=strlen(s),l=0;
        for(int i=0;i<len;i++)
        {
            if(s[i]=='v')
            {
                int num=0;
                for(int j=i;s[j]=='v'&&j<len;j++)
                    num++,i++;
                if(num>=2)
                    s[l++]='w';
                else s[l++]='v';
                i--;
            }
            else s[l++]=s[i];
        }
        s[l]=0;
        int flag=0;
        for(int i=0;i<l;i++)
        {
            if(flag==0&&s[i]=='w') flag=1;
            else if(flag==1&&s[i]=='y') flag=2;
            else if(flag==2&&s[i]=='h') flag=3;
        }
        if(flag==3) puts("Yes");
        else puts("No");
    }
    return 0;
}