ture

#include <fstream>
#define Nmax 101
using namespace std;
ifstream f("ture.in");
ofstream g("ture.out");
int n,a[Nmax][Nmax],lin[Nmax],col[Nmax],i,j,i1,j1,i2,j2,maxim1,maxim2,rezultat,t;

int main()
{
    f>>n;
    for(i=1;i<=n;++i)
        for(j=1;j<=n;++j)
            f>>a[i][j],lin[i]+=a[i][j],col[j]+=a[i][j];
    rezultat=0;
    for(int i=1;i<=n;++i) ///cazul 1
        for(int j1=1;j1<=n;++j1)
            for(int j2=1;j2<=n;++j2)
            {
                if(j1==j2)
                    continue;
                t=lin[i]+col[j1]+col[j2]-2*a[i][j1]-2*a[i][j2];
                if(t>rezultat)
                    rezultat=t;
            }
    for(int j=1;j<=n;++j) ///cazul 2
        for(int i1=1;i1<=n;++i1)
            for(int i2=1;i2<=n;++i2)
            {
                if(i1==i2)
                    continue;
                t=col[j]+lin[i1]+lin[i2]-2*a[i1][j]-2*a[i2][j];
                if(t>rezultat)
                    rezultat=t;
            }
    for(int i1=1;i1<=n;++i1) ///cazul 3
        for(int i2=1;i2<=n;++i2)
        {
            if(i1==i2)
                continue;
            maxim1=-1000;
            for(int j=1;j<=n;++j)
            {
                t=col[j]-a[i2][j]-2*a[i1][j];
                if(t>maxim1)
                    j1=j,maxim1=t;
            }
            maxim2=-1000;
            for(j=1;j<=n;++j)
            {
                t=col[j]-a[i1][j]-2*a[i2][j];
                if((j!=j1)&&(t>maxim2))
                    j2=j,maxim2=t;
            }
            t=lin[i1]+lin[i2]+col[j1]-a[i2][j1]-2*a[i1][j1]+col[j2]-a[i1][j2]-2*a[i2][j2];
            if(t>rezultat)
                rezultat=t;
       }
       g<<rezultat;
    return 0;
}