Envío 5125

Código

def is_magic_square(n, square):
    c = sum(square[0])
    # Rows
    for i in range(1, n):
        if sum(square[i]) != c:
            return False
    # Cols
    for j in range(0, n):
        s = 0
        for i in range(n):
            s += square[i][j]
        if s != c:
            return False
    # Diagonal 1
    s = sum(square[i][i] for i in range(n))
    if s != c:
        return False
    # Diagonal 2
    s = sum(square[i][n - i - 1] for i in range(n))
    if s != c:
        return False
    return True


n = int(input())
square = []
for _ in range(n):
    row = [int(j) for j in input().split()]
    square.append(row)
ans = is_magic_square(n, square)
print('Yes' if ans else 'No')