#include <bits/stdc++.h>
using namespace std;
int gcd(int p, int q) { return q == 0 ? p : gcd(q, p % q); }
int main() {
  int n, num[35][35], sumh[35], suml[35];
  cin >> n;
  memset(sumh, 0, sizeof(sumh));
  memset(suml, 0, sizeof(suml));
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      cin >> num[i][j];
    }
  }
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      sumh[i] += num[i][j];
      suml[i] += num[j][i];
    }
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    for (int j = 1; j <= n; j++) {
      if (suml[j] > sumh[i]) {
        ans++;
      }
    }
  }
  cout << ans << endl;
  return 0;
}
