https://www.codetree.ai/missions/2/problems/max-sum-of-numbers?&utm_source=clipboard&utm_medium=text
n = int(input())
arr = []
for i in range(n):
arr.append(list(map(int,input().split())))
visited = [False] * n
ans = -1
def f(d,s):
global ans
if d == n:
ans = max(s,ans)
return
for i in range(n):
if not visited[i]:
visited[i] = True
f(d+1,s+arr[d][i])
visited[i] = False
f(0,0)
print(ans)