output_description: If Takahashi's statement is correct, print `Yes`; otherwise, print `No`.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      c_{1,1} c_{1,2} c_{1,3}
      c_{2,1} c_{2,2} c_{2,3}
      c_{3,1} c_{3,2} c_{3,3}
attempt: n = []
  m = [[0 for i in range(3)] for j in range(2)]
  for x in range(3):
      n.append(list(map(int, input().split())))
  
  k = max(n)
  kaisuu = max(k) + 1
  
  
  def tansa(m):
      iti = 2
      for j in range(kaisuu):
          for k in range(kaisuu):
              if j + k == n[iti][iti]:
                  m[0][iti] = j
                  m[1][iti] = k
                  for a in range(kaisuu):
                      for b in range(kaisuu):
                          if (
                              a + b == n[iti - 1][iti - 1]
                              and a + m[1][iti] == n[iti - 1][iti]
                          ):
                              m[0][iti - 1] = a
                              m[1][iti - 1] = b
                              for c in range(kaisuu):
                                  for d in range(kaisuu):
                                      if (
                                          c + d == n[iti - 2][iti - 2]
                                          and c + m[1][iti - 1] == n[iti - 2][iti - 1]
                                          and c + m[1][iti] == n[iti - 2][iti]
                                      ):
                                          m[0][iti - 2] = c
                                          m[1][iti - 2] = d
                                          if (
                                              m[0][1] + m[1][0] == n[1][0]
                                              and m[0][2] + m[1][0] == n[2][0]
                                              and m[0][2] + m[1][1] == n[2][1]
                                          ):
                                              print("Yes")
                                              exit()
  
  
  tansa(m)
  print("No")
  
problem_description: Statement
  
  We have a 3 \times 3 grid. A number c_{i, j} is written in the square (i, j),
  where (i, j) denotes the square at the i-th row from the top and the j-th
  column from the left.  
  According to Takahashi, there are six integers a_1, a_2, a_3, b_1, b_2, b_3
  whose values are fixed, and the number written in the square (i, j) is equal
  to a_i + b_j.  
  Determine if he is correct.
samples: [{"input": "1 0 1\n    2 1 2\n    1 0 1", "output": "Yes\n    \n\nTakahashi is correct, since there are possible sets of integers such as:\na_1=0,a_2=1,a_3=0,b_1=1,b_2=0,b_3=1.\n\n* * *"}, {"input": "2 2 2\n    2 1 2\n    2 2 2", "output": "No\n    \n\nTakahashi is incorrect in this case.\n\n* * *"}, {"input": "0 8 8\n    0 8 8\n    0 8 8", "output": "Yes\n    \n\n* * *"}, {"input": "1 8 6\n    2 9 7\n    0 7 7", "output": "No"}]