n = int(input())
g = [[] for _ in range(n)]
for i in range(n):
g[i] = list(map(int, input().split()))
for i in range(1, n):
for j in range(i+1):
if j == 0:
g[i][j] = g[i-1][j] + g[i][j]
continue
if j == i:
g[i][j] = g[i-1][j-1] + g[i][j]
continue
g[i][j] = max(g[i-1][j-1] + g[i][j] , g[i-1][j] + g[i][j])
print(*g, sep = '\n')
print(max(g[n-1]))
dp + 이차원 리스트