#include #include #define rep(i,n) for(int i=0;i P; template ostream& operator<<(ostream& os, const static_modint& a) {os << a.val(); return os;} template ostream& operator<<(ostream& os, const dynamic_modint& a) {os << a.val(); return os;} template istream& operator>>(istream& is, static_modint& a) {long long x; is >> x; a = x; return is;} template istream& operator>>(istream& is, dynamic_modint& a) {long long x; is >> x; a = x; return is;} template istream& operator>>(istream& is, vector& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;} template ostream& operator<<(ostream& os, const pair& p){os << p.first << ' ' << p.second; return os;} template ostream& operator<<(ostream& os, const vector& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;} template ostream& operator<<(ostream& os, const vector>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;} template ostream& operator<<(ostream& os, const set& se){for(T x : se) os << x << " "; os << "\n"; return os;} template ostream& operator<<(ostream& os, const unordered_set& se){for(T x : se) os << x << " "; os << "\n"; return os;} template ostream& operator<<(ostream& os, const atcoder::segtree& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template ostream& operator<<(ostream& os, const atcoder::lazy_segtree& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;} template void chmin(T& a, T b){a = min(a, b);} template void chmax(T& a, T b){a = max(a, b);} int main(){ vector one = {"gray","brown","green","cyan","blue","yellow","orange","red"}; vector two = {"gray","green","blue","yellow","red"}; vector three = {"gray","green","cyan","blue","violet","orange","red"}; vector s(3); cin >> s; set> se; vector perm = {0, 1, 2}; do{ int tmp = 0; if(count(one.begin(), one.end(), s[perm[0]]) == 1) tmp++; if(count(two.begin(), two.end(), s[perm[1]]) == 1) tmp++; if(count(three.begin(), three.end(), s[perm[2]]) == 1) tmp++; if(tmp == 3) se.insert(vector{s[perm[0]], s[perm[1]], s[perm[2]]}); }while(next_permutation(perm.begin(), perm.end())); if(int(se.size()) == 1) cout << "Yes\n"; else cout << "No\n"; return 0; }