#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
inline int my_getchar_unlocked(){
  static char buf[1048576];
  static int s = 1048576;
  static int e = 1048576;
  if(s == e && e == 1048576){
    e = fread_unlocked(buf, 1, 1048576, stdin);
    s = 0;
  }
  if(s == e){
    return EOF;
  }
  return buf[s++];
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = my_getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = my_getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
struct MY_WRITER{
  char buf[1048576];
  int s;
  int e;
  MY_WRITER(){
    s = 0;
    e = 1048576;
  }
  ~MY_WRITER(){
    if(s){
      fwrite_unlocked(buf, 1, s, stdout);
    }
  }
}
;
MY_WRITER MY_WRITER_VAR;
void my_putchar_unlocked(int a){
  if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){
    fwrite_unlocked(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);
    MY_WRITER_VAR.s = 0;
  }
  MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;
}
inline void wt_L(char a){
  my_putchar_unlocked(a);
}
inline void wt_L(long long x){
  int s=0;
  int m=0;
  char f[20];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    my_putchar_unlocked('-');
  }
  while(s--){
    my_putchar_unlocked(f[s]+'0');
  }
}
int N;
int A[1000][1000];
long long sm[1000];
long long val[1000];
int up[1000][1000];
int dw[1000][1000];
int main(){
  int i;
  int j;
  int k;
  int cur;
  int ad;
  long long res = 0;
  rd(N);
  {
    int Lj4PdHRW;
    int KL2GvlyY;
    for(Lj4PdHRW=(0);Lj4PdHRW<(N);Lj4PdHRW++){
      for(KL2GvlyY=(0);KL2GvlyY<(N);KL2GvlyY++){
        rd(A[Lj4PdHRW][KL2GvlyY]);A[Lj4PdHRW][KL2GvlyY] += (-1);
      }
    }
  }
  for(i=(0);i<(N);i++){
    for(j=(0);j<(N);j++){
      k = A[i][j];
      sm[k] += j;
      if(i-j-1 >= 0){
        up[k][i-j-1]++;
      }
      if(i+j+1 <  N){
        dw[k][i+j+1]++;
      }
    }
  }
  for(k=(0);k<(N);k++){
    for(i=(0);i<(N);i++){
      val[i] = sm[k];
    }
    cur = ad = 0;
    for(i=(0);i<(N);i++){
      ad += dw[k][i];
      cur += ad;
      val[i] += cur;
    }
    cur = ad = 0;
    for(i=(N)-1;i>=(0);i--){
      ad += up[k][i];
      cur += ad;
      val[i] += cur;
    }
    {
      int jZyWAPpY;
      long long jbtyPBGc;
      if(N==0){
        jbtyPBGc = 0;
      }
      else{
        jbtyPBGc = val[0];
        for(jZyWAPpY=(1);jZyWAPpY<(N);jZyWAPpY++){
          jbtyPBGc = min_L(jbtyPBGc, val[jZyWAPpY]);
        }
      }
      res +=jbtyPBGc;
    }
  }
  wt_L(res);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200412-1

// --- original code ---
// int N, A[1000][1000];
// ll sm[1000], val[1000];
// int up[1000][1000], dw[1000][1000];
// {
//   int i, j, k, cur, ad;
//   ll res = 0;
//   rd(N,(A--)(N,N));
//   rep(i,N) rep(j,N){
//     k = A[i][j];
//     sm[k] += j;
//     if(i-j-1 >= 0) up[k][i-j-1]++;
//     if(i+j+1 <  N) dw[k][i+j+1]++;
//   }
//   rep(k,N){
//     rep(i,N) val[i] = sm[k];
//     cur = ad = 0;
//     rep(i,N){
//       ad += dw[k][i];
//       cur += ad;
//       val[i] += cur;
//     }
//     cur = ad = 0;
//     rrep(i,N){
//       ad += up[k][i];
//       cur += ad;
//       val[i] += cur;
//     }
//     res += min(val(N));
// //    wt(val(N),":",sm[k],":",up[k](N),dw[k](N));
//   }
//   wt(res);
// }