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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include<iostream>
#include<map>
#include<set>
#include<list>
#include<queue>
#include<cmath>
#include<string>
#include<string.h>
#include<iomanip>
#include<stdlib.h>
#include<algorithm>
typedef long long ll;
using namespace std;

int main()
{
	int a,b;
	int flaga = 0,flagb = 0;
	cin >> a >> b;
	if(a == 1 || a == 3 || a == 5 || a == 7 || a == 8 || a == 10 || a == 12)
		flaga = 1;
	else if(a == 4 || a == 6 || a == 9 || a == 11)
		flaga = 2;
	else if(a == 2)
		flaga == 3;
	if(b == 1 || b == 3 || b == 5 || b == 7 || b == 8 || b == 10 || b == 12)
		flagb = 1;
	else if(b == 4 || b == 6 || b == 9 || b == 11)
		flagb = 2;
	else if(b == 2)
		flagb == 3;
	if(flaga == flagb)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
	return 0;
}