#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
const long long mod=998244353;
const long long hmod=46216567629137;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    string one[8]={"gray","brown","green","cyan","blue","yellow","orange","red"};
    string two[5]={"gray","green","blue","yellow","red"};
    string three[7]={"gray","green","cyan","blue","violet","orange","red"};
    int cnt=0;
    vector<string>S(3);
    rep(i,3) cin>>S[i];
    sort(S.begin(),S.end());
    do{
        rep(i,8){
            rep(j,5){
                rep(k,7){
                    if(S[0]==one[i] && S[1]==two[j] && S[2]==three[k]){
                        cnt++;
                    }
                }
            }
        }
    }while(next_permutation(S.begin(),S.end()));
    if(cnt==1) cout<<"Yes\n";
    else cout<<"No\n";
}