#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#include <cassert>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
//using mint = modint1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repu(i, s, t) for (int i = (int)(s); i < (int)(t); i++)
#define repd(i, s, t) for (int i = (int)(s)-1; i >= (int)(t); i--)
#define all(v) v.begin(), v.end()
void _u() { cerr << endl; } template <class H, class... T> void _u(H&& h, T&&... t) { cerr << h << ", "; _u(move(t)...); }
#define U(...) { cerr << #__VA_ARGS__ << ": "; _u(__VA_ARGS__); }
template<typename T> bool chmax(T &a, const T b) { if(a >= b) return false; a = b; return true; }
template<typename T> bool chmin(T &a, const T b) { if(a <= b) return false; a = b; return true; }
template<typename T> istream& operator>>(istream &in, vector<T> &a) { for(T &x: a) in >> x; return in; }
template<typename T> ostream& operator<<(ostream &out, const vector<T> &a) { for(const T &x: a) out << x << ' '; return out; }
const int di[] = {1, 0, -1, 0, 1, 1, -1, -1, 0};
const int dj[] = {0, 1, 0, -1, -1, 1, 1, -1, 0};


int main() {
    set<string> one = {"gray","brown","green","cyan","blue","yellow","orange","red"};
    set<string> two = {"gray","green","blue","yellow","red"};
    set<string> three = {"gray","green","cyan","blue","violet","orange","red"};
    vector<string> s(3);
    cin >> s;
    sort(all(s));
    vector<string> ans;
    do {
        bool ok = true;
        if(!one.count(s[0])) ok = false;
        if(!two.count(s[1])) ok = false;
        if(!three.count(s[2])) ok = false;
        if(ok) {
            if(!ans.empty()) {
                cout << "No" << endl;
                return 0;
            }
            ans = s;
        }
    } while(next_permutation(all(s)));
    if(ans.empty()) cout << "No" << endl;
    else cout << "Yes" << endl;
    return 0;
}