output_description: If x and y belong to the same group, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      x y
attempt: from collections import defaultdict, Counter
  from itertools import product, groupby, count, permutations, combinations
  from math import pi, sqrt
  from collections import deque
  from bisect import bisect, bisect_left, bisect_right
  from string import ascii_lowercase
  from functools import lru_cache
  import sys
  
  sys.setrecursionlimit(10000)
  INF = float("inf")
  YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
  dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
  dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
  
  
  def inside(y, x, H, W):
      return 0 <= y < H and 0 <= x < W
  
  
  def ceil(a, b):
      return (a + b - 1) // b
  
  
  def main():
      x, y = map(int, input().split())
      a = [1, 3, 5, 7, 8, 10, 12]
      b = [4, 6, 9, 11]
      c = [2]
      if (x in a and y in a) or (x in b and y in b) or (x in c and y in c):
          print(Yes)
      else:
          print(No)
  
  
  if __name__ == "__main__":
      main()
  
problem_description: 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.
  
  ![b4ab979900ed647703389d4349eb84ee.png](https://atcoder.jp/img/arc074/b4ab979900ed647703389d4349eb84ee.png)
samples: [{"input": "1 3", "output": "Yes\n    \n\n* * *"}, {"input": "2 4", "output": "No"}]