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: import math
  import queue
  import bisect
  import heapq
  import time
  import itertools
  
  mod = int(1e9 + 7)
  
  
  def swap(a, b):
      return (b, a)
  
  
  def gcd(a, b):  # 最大公約数
      if a < b:
          a, b = swap(a, b)
      if b == 0:
          return a
      else:
          return gcd(b, a % b)
  
  
  def lcm(a, b):  # 最小公倍数
      return a / gcd(a, b) * b
  
  
  def divisors(a):  # 約数列挙
      divisors = []
      for i in range(1, int(a**0.5) + 1):
          if a % i == 0:
              divisors.append(i)
              if i != a // i:
                  divisors.append(a // i)
      return divisors
  
  
  def is_prime(a):  # 素数判定
      if a < 2:
          return False
      elif a == 2:
          return True
      elif a % 2 == 0:
          return False
      sqrt_num = int(a**0.5)
      for i in range(3, sqrt_num + 1, 2):
          if a % i == 0:
              return False
      return True
  
  
  def prime_num(a):  # 素数列挙
      pn = [2]
      for i in range(3, int(a**0.5), 2):
          prime = True
          for j in pn:
              if i % j == 0:
                  prime = False
                  break
          if prime:
              pn.append(i)
      return pn
  
  
  def prime_fact(a):  # 素因数分解
      sqrt = math.sqrt(a)
      res = []
      i = 2
      if is_prime(a):
          res.append(a)
      else:
          while a != 1:
              while a % i == 0:
                  res.append(i)
                  a //= i
              i += 1
      return res
  
  
  def main():
      l1 = [1, 3, 5, 7, 8, 10, 12]
      l2 = [4, 6, 9, 11]
      x, y = map(int, input().split())
      if x == 2 or y == 2:
          print("No")
      elif x in l1 and y in l1:
          print("Yes")
      elif x in l2 and y in l2:
          print("Yes")
      else:
          print("No")
      return
  
  
  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"}]