#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	vector<vector<string>> table = {
		{"gray","brown","green","cyan","blue","yellow","orange","red"},
		{"gray","green","blue","yellow","red"},
		{"gray","green","cyan","blue","violet","orange","red"}
	};

	vector<string> s(3);
	rep(i, 3)cin >> s[i];
	sort(s.begin(), s.end());
	int cnt = 0;
	do {
		bool chk = true;
		for (int i = 0; i < 3; i++) {
			if (count(table[i].begin(), table[i].end(), s[i]) == 0) {
				chk = false;
				break;
			}
		}
		cnt += chk;
	} while (next_permutation(all(s)));
	cout << (cnt == 1 ? "Yes" : "No") << endl;
	return 0;
}