#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<deque>
#include<fstream>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<utility>
#include<vector>

using namespace std;

int N,i,j;
char S[105],*p;
char P[]="Yardi";

int main()
{
    scanf("%s",S);
    N=strlen(S);
    for(i=0;i<N-5;i++)
    {
        for(j=0;j<5;j++)
            if(S[i+j]!=P[j]) break;
        if(j>=5) {printf("YES\n"); return 0;}
    }
    printf("NO\n");
    return 0;
}