Проверка магического квадрата

rows = tuple(tuple(map(int, input().split())) for _ in range(int(input())))
cols = tuple(map(lambda x: x[0], zip(rows)))
diagonals = ((rows[0][0], rows[1][1], rows[2][2]), (rows[0][2], rows[1][1], rows[2][0]))
 
print('Yes' if len(set(map(sum, rows + cols + diagonals))) == 1 else 'No')

n = int(input('n = '))
rows = [[int(x) for x in input('->').split()] for _ in range(n)]
cols = list(zip(*rows))
diag_1 = [rows[i][i] for i in range(n)]
diag_2 = [rows[i][n-1-i] for i in range(n)]
*arr, = map(sum, rows + cols + [diag_1] + [diag_2])
print(['No','Yes'][arr == [sum(diag_1)] * len(arr)])

def fff(arr) -> bool:
    n = len(arr)
    trixie = sum(arr[0])
    for i in range(1, n):
        s = 0
        for j in range(n):
            s += arr[i][j]
        if s != trixie:
            return False
    for j in range(n):
        s = 0
        for i in range(n):
            s += arr[i][j]
        if s != trixie:
            return False
    s = 0
    for i in range(n):
        s += arr[i][i]
    if s != trixie:
        return False
    s = 0
    for i in range(n):
        s += arr[i][n - 1 - i]
    if s != trixie:
        return False
    return True
 
arr = (
    (8, 1, 6),
    (3, 5, 7),
    (4, 9, 2),
)
print(fff(arr))