Envío 871

Código

def get_main_diagonal_sum(matrix, n):
  return sum([matrix[i][i] for i in range(n)])

def get_secondary_diagonal_sum(matrix, n):
  return sum([matrix[i][n - i - 1] for i in range(n)])

def get_rows_sum(matrix, n):
  row_sum = [sum(row) for row in matrix]
  return sum(row_sum)

def get_columns_sum(matrix, n):
  col_sum = [sum(row) for row in zip(*matrix)]
  return sum(col_sum)

def is_magic_square(matrix):
  n = len(matrix)

  current_sum = get_main_diagonal_sum(matrix, n)
  current_sum = current_sum - get_secondary_diagonal_sum(matrix, n)

  if current_sum != 0:
    return False
  
  current_sum = get_rows_sum(matrix, n)
  current_sum = current_sum - get_columns_sum(matrix, n)

  return current_sum == 0

def main():
  n = int(input())
  matrix = []

  for cols in range(n):
    matrix.append([int(value) for value in input().split()])

  if is_magic_square(matrix):
    print("Yes")
  else:
    print("No")

if __name__ == "__main__":
  main()