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: Wrong Answer)

#include <algorithm>
#include <iostream>
#include<string>
using namespace std;


int main()
{
	int A, B,D=0;
	cin  >> A >> B;
	int C[4] = { 4,6,9,11 };
	for (int i = 0; i < 4; i++) {
		if (A == C[i]) {
			D++;
		}
		if (B == C[i]) {
			D++;
		}
	}
	if (A==2||B==2) {
		cout << "No" << endl;
	}
	else if(D==2||D==0){
		cout << "Yes" << endl;
	}
	
    return 0;
}