#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,s,n) for (int i = (s); i < (n); ++i)
#define rrep(i,n,g) for (int i = (n)-1; i >= (g); --i)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define len(x) (int)(x).size()
#define dup(x,y) (((x)+(y)-1)/(y))
#define pb push_back
#define eb emplace_back
#define Field(T) vector<vector<T>>
using namespace std;
using ll = long long;
using ull = unsigned long long;
template<typename T> using pq = priority_queue<T,vector<T>,greater<T>>;
using P = pair<int,int>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}

int main() {
  vector<string> v1 = {"gray","brown","green","cyan","blue","yellow","orange","red"}
                ,v2 = {"gray","green","blue","yellow","red"}
                ,v3 = {"gray","green","cyan","blue","violet","orange","red"};
  vector<string> s(3);
  rep(i,0,3) cin >> s[i];
  sort(all(s));
  int cnt = 0;
  rep(i,0,8) rep(j,0,5) rep(k,0,7) {
    vector<string> t(3);
    t[0] = v1[i], t[1] = v2[j], t[2] = v3[k];
    sort(all(t));
    if (s == t) ++cnt;
  }
  if (cnt == 1) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}