N=int(input())
mx=[-(1<<60)]*32
cofs=[]
for i in range(N):
	cof=list(map(int,input().split()))
	table=[0]*32
	for j in range(1<<5):
		now=0
		for k in range(5):
			if (j>>k)&1:
				now+=cof[k]
			else:
				now-=cof[k]
		table[j]=now
		mx[j]=max(mx[j],now)
	cofs.append(table)
for i in range(N):
	ans=0
	for j in range(1<<5):
		ans=max(ans,cofs[i][j]+mx[31-j])
	print(ans)