import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0)
#input = sys.stdin.readline
#n = int(input())
#a = list(map(int,input().split()))
#a = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    a.append(list(map(int,input().split())))
a = ["gray","brown","green","cyan","blue","yellow","orange","red"]
b = ["gray","green","blue","yellow","red"]
c = ["gray","green","cyan","blue","violet","orange","red"]
x,y,z =input().split()
ans = set()
for i in itertools.permutations([x,y,z]):
    if i[0] in a and i[1] in b and i[2] in c:
        ans.add((i[0],i[1],i[2]))
print('Yes' if len(ans) == 1 else 'No')