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

//
//  main.c
//  procon
//
//  Created by Lee, Chanyeong | Naru | MSDD on 2017. 10. 16..
//  Copyright © 2017년 Lee, Chanyeong | Naru | MSDD. All rights reserved.
//

#include <stdio.h>

int main(int argc, const char * argv[]) {
    // insert code here...
    int a, b;
    int arrayInt_a[] = {1,3,5,7,8,10,12};
    int arrayInt_b[] = {4,6,9,11};
    
    int flag = 0;
    
    scanf("%d %d", &a, &b);
    
    int i = 0;
    if(a == 2 || b == 2) {
        printf("No");
        return 0;
    }

    for (i=0; i<4; i++) {
        if (a == arrayInt_b[i]) {
            flag = 1;
            break;
        }
    }
    
    if (flag == 0) {
        for (i=0; i<7; i++) {
            if (b == arrayInt_a[i]) {
                printf("Yes");
                return 0;
            }
        }
    }
    else if (flag == 1) {
        for (i=0; i<4; i++) {
            if (b == arrayInt_b[i]) {
                printf("Yes");
                return 0;
            }
        }
    }
    
    printf("No");
    
    return 0;
}