#include <bits/stdc++.h>
using namespace std;

int main() {
	vector<vector<string>> c = {{"gray","brown","green","cyan","blue","yellow","orange","red"}, {"gray","green","blue","yellow","red"}, {"gray","green","cyan","blue","violet","orange","red"}};
	vector<set<string>> col(3);
	for(int i = 0; i < 3; i++) {
		for(string o : c[i]) {
			col[i].insert(o);
		}
	}
	vector<string> S(3);
	for(string &o : S) {
		cin >> o;
	}
	sort(S.begin(), S.end());
	int cnt = 0, tmp = 6;
	set<vector<string>> p;
	while(tmp > 0) {
		bool f = true;
		for(int i = 0; i < 3; i++) {
			if(!col[i].count(S[i])) {
				f = false;
			}
		}
		if(f && !p.count(S)) {
			cnt++;
			p.insert(S);
		}
		tmp--;
		next_permutation(S.begin(), S.end());
	}
	cout << (cnt == 1 ? "Yes" : "No") << endl;
}