Problem:
Score : 100 points

Problem Statement

Based on some criterion, Snuke divided the integers from 1 through 12 into three groups as shown in the figure below.
Given two integers x and y (1 ≤ x < y ≤ 12), determine whether they belong to the same group.

Constraints

x and y are integers.

1 ≤ x < y ≤ 12

Input

Input is given from Standard Input in the following format:

x y

Output

If x and y belong to the same group, print Yes; otherwise, print No.

Sample Input 1

1 3

Sample Output 1

Yes

Sample Input 2

2 4

Sample Output 2

No

Solution in C++ (GCC 9.2.1) (judge verdict: Accepted)

#include <bits/stdc++.h>
using namespace std;
using ll =long long;
#define all(v) v.begin(),v.end()
 
int main() {
ll x,y;
  cin>>x>>y;
  if(x==2||y==2) {
cout<<"No"<<endl;
  return 0;
  }
  
  set<ll> S;
  S.insert(4);
   S.insert(6);
   S.insert(9);
   S.insert(11);
  
  if(S.count(x)&&!S.count(y)) {
cout<<"No"<<endl;
  }
  else if(!S.count(x)&&S.count(y)) {
cout<<"No"<<endl;
  }
  else {
cout<<"Yes"<<endl;
  }
}