import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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)); }


int N, M;
int[][][] C;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      M = readInt();
      C = new int[][][](M, N, N);
      foreach (i; 0 .. M) {
        foreach (x; 0 .. N) foreach (y; 0 .. N) {
          C[i][x][y] = readInt();
        }
      }
      
      auto css = new int[][][M];
      foreach (i; 0 .. M) {
        foreach (x; 0 .. N) {
          css[i] ~= iota(N).map!(y => C[i][x][y]).array;
        }
        foreach (y; 0 .. N) {
          css[i] ~= iota(N).map!(x => C[i][x][y]).array;
        }
        css[i] ~= iota(N).map!(x => C[i][x][x]).array;
        css[i] ~= iota(N).map!(x => C[i][x][N - 1 - x]).array;
        foreach (ref cs; css[i]) {
          cs.sort;
        }
      }
      
      int ans = N * N + 1;
      foreach (i; 0 .. M) foreach (j; i + 1 .. M) {
        foreach (p; css[i]) foreach (q; css[j]) {
          chmin(ans, cast(int)(merge(p, q).uniq.array.length));
        }
      }
      writeln(ans - 1);
    }
  } catch (EOFException e) {
  }
}