#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

string A[]={"gray","brown","green","cyan","blue","yellow","orange","red"};
string B[]={"gray","green","blue","yellow","red"};
string C[]={"gray","green","cyan","blue","violet","orange","red"};
string S[3];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S[0]>>S[1]>>S[2];
	set<array<string,3>> V;
	
	sort(S,S+3);
	do {
		int ok=0;
		FORR(a,A) if(S[0]==a) ok++;
		FORR(b,B) if(S[1]==b) ok++;
		FORR(c,C) if(S[2]==c) ok++;
		if(ok==3) V.insert({S[0],S[1],S[2]});
	} while(next_permutation(S,S+3));
	
	if(V.size()==1) cout<<"Yes"<<endl;
	else cout<<"No"<<endl;
	
	
		
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}