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 <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <iomanip>
#include <cstdlib>
#include <cctype>
#define ll long long
#define PI 3.14159265358979323846
using namespace std;

int main(){
	int a[7]={1,3,5,7,8,10,12};
	int b[4]={4,6,9,11};
	int c=2;
	int x,y;
	int fx=0,fy=0;
	cin>>x>>y;
	for(int i=0;i<7;i++){
		if(a[i]==x){
			fx=1;
		}
		else if(a[i]==y){
			fy=1;
		}
	}
	if(fx&&fy){
		cout<<"Yes"<<endl;
		return 0;
	}
	else{
		cout<<"No"<<endl;
		return 0;
	}
	fx=0;fy=0;
	for(int i=0;i<4;i++){
		if(a[i]==x){
			fx=1;
		}
		else if(a[i]==y){
			fy=1;
		}
	}
	if(fx&&fy){
		cout<<"Yes"<<endl;
		return 0;
	}
	else{
		cout<<"No"<<endl;
		return 0;
	}
	return 0;
}