#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>
#include <cstdio>
using namespace std;
long long int hori[1010], verti[1010];
long long int grid[1010][1010];
int main() {
int N;
long long int ans = -1e18;
cin>>N;
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
cin>>grid[i][j];
}
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
hori[i] += grid[i][j];
verti[j] += grid[i][j];
}
}
for(int i = 0; i < N; i++) {
for(int j = 0; j < N; j++) {
ans = max(ans, hori[i]+verti[j]-grid[i][j]);
}
}
cout<<ans<<endl;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8ZnN0cmVhbT4KI2luY2x1ZGUgPHZlY3Rvcj4KI2luY2x1ZGUgPHF1ZXVlPgojaW5jbHVkZSA8c3RhY2s+CiNpbmNsdWRlIDxhbGdvcml0aG0+CiNpbmNsdWRlIDxjc3RkaW8+CiAKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKIApsb25nIGxvbmcgaW50IGhvcmlbMTAxMF0sIHZlcnRpWzEwMTBdOwpsb25nIGxvbmcgaW50IGdyaWRbMTAxMF1bMTAxMF07CiAKaW50IG1haW4oKSB7CglpbnQgTjsKCWxvbmcgbG9uZyBpbnQgYW5zID0gLTFlMTg7CgljaW4+Pk47Cglmb3IoaW50IGkgPSAwOyBpIDwgTjsgaSsrKSB7CgkJZm9yKGludCBqID0gMDsgaiA8IE47IGorKykgewoJCQljaW4+PmdyaWRbaV1bal07CgkJfQoJfQoJZm9yKGludCBpID0gMDsgaSA8IE47IGkrKykgewoJCWZvcihpbnQgaiA9IDA7IGogPCBOOyBqKyspIHsKCQkJaG9yaVtpXSArPSBncmlkW2ldW2pdOwoJCQl2ZXJ0aVtqXSArPSBncmlkW2ldW2pdOwoJCX0KCX0KCWZvcihpbnQgaSA9IDA7IGkgPCBOOyBpKyspIHsKCQlmb3IoaW50IGogPSAwOyBqIDwgTjsgaisrKSB7CgkJCWFucyA9IG1heChhbnMsIGhvcmlbaV0rdmVydGlbal0tZ3JpZFtpXVtqXSk7CgkJfQoJfQoJY291dDw8YW5zPDxlbmRsOwp9CiA=