#include <bits/stdc++.h>
#define ll long long 
#define rep(i, x, y) for(int i = x; i <= y; i ++)
using namespace std;
const int N = 1010;
int a[N][N], id[N], value[N];
int n;
bool cmp(int a, int b)
{
	return value[a] < value[b];
}
int main()
{
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    cin >> n;
    rep(i, 1, n)
    {
    	rep(j, 1, n)
    	{
            cin >> a[i][j];
            value[i] += a[i][j];
        }
        id[i] = i;
    }
    sort(id + 1, id + n + 1, cmp);
    ll res = 0;
    rep(i, 1, n / 2)
    	rep(j, i + 1, n / 2)
            res -= a[id[i]][id[j]];
    rep(i, n / 2 + 1, n)
    	rep(j, i + 1, n)
            res += a[id[i]][id[j]];
    res = abs(res);
    cout << res << "\n";
    return 0;
}