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.

b4ab979900ed647703389d4349eb84ee.png

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`.

Examples

Input

1 3


Output

Yes


Input

2 4


Output

No
import java.util.Scanner;

public class Main {
    static final int[][] GROUPS = { { 1, 3, 5, 7, 8, 10, 12 }, { 4, 6, 9, 11 }, { 2 } };

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int x = sc.nextInt();
        int y = sc.nextInt();

        System.out.println(solve(x, y) ? "Yes" : "No");

        sc.close();
    }

    static boolean solve(int x, int y) {
        return findGroup(x) == findGroup(y);
    }

    static int findGroup(int n) {
        for (int i = 0;; ++i) {
            for (int v : GROUPS[i]) {
                if (n == v) {
                    return i;
                }
            }
        }
    }
}