#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FILL(a, b) memset(a, b, sizeof(a))

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

const int MAX = 1 << 10;

int c[MAX][MAX];
int s[MAX];
int idxes[MAX];

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n;
	cin >> n;
	FOR(i, 0, n) {
		FOR(j, 0, n) {
			cin >> c[i][j];
			s[i] += c[i][j];
		}
	}
	iota(idxes, idxes + n, 0);
	sort(idxes, idxes + n, [](int i, int j) {return s[i] > s[j];});
	LL ans = 0;
	FOR(i, 0, n) {
		int xi = i < n / 2 ? 1 : -1;
		FOR(j, i + 1, n) {
			int xj = j < n / 2 ? 1 : -1;
			ans += (xi + xj) * c[idxes[i]][idxes[j]];
		}
	}
	cout << ans / 2 << "\n";
	return 0;
}