import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt();
      auto A = new int[][](N, N);
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        A[x][y] = readInt() - 1;
      }
      
      alias Pt = Tuple!(int, "x", int, "y");
      auto pss = new Pt[][N];
      foreach (x; 0 .. N) foreach (y; 0 .. N) {
        pss[A[x][y]] ~= Pt(x, y);
      }
      
      long ans;
      foreach (i; 0 .. N) {
        auto sum0 = new long[N + 1];
        auto sum1 = new long[N + 1];
        foreach (ref p; pss[i]) {
          // [p.x - p.y, p.x + p.y]
          const lb = max(p.x - p.y, 0);
          const ub = min(p.x + p.y, N - 1) + 1;
          // p.x - x
          sum0[0] += p.x;
          sum0[lb] -= p.x;
          sum1[0] += -1;
          sum1[lb] -= -1;
          // p.y
          sum0[lb] += p.y;
          sum0[ub] -= p.y;
          // x - p.x
          sum0[ub] += -p.x;
          sum0[N] -= -p.x;
          sum1[ub] += 1;
          sum1[N] -= 1;
        }
        foreach (x; 0 .. N) {
          sum0[x + 1] += sum0[x];
          sum1[x + 1] += sum1[x];
        }
        auto costs = new long[N];
        foreach (x; 0 .. N) {
          costs[x] = sum0[x] + sum1[x] * x;
        }
        debug {
          writeln(costs);
        }
        ans += costs.minElement;
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}