#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N, M;
  cin >> N >> M;
  int C[M][N][N];

  for (int i = 0; i < M; ++i) {
    for (int y = 0; y < N; ++y) {
      for (int x = 0; x < N; ++x) {
        cin >> C[i][y][x];
      }
    }
  }

  vector<vector<int>> lines[M];

  for (int i = 0; i < M; ++i) {
    for (int y = 0; y < N; ++y) {
      vector<int> line;

      for (int x = 0; x < N; ++x) {
        line.push_back(C[i][y][x]);
      }

      lines[i].push_back(line);
    }

    for (int x = 0; x < N; ++x) {
      vector<int> line;

      for (int y = 0; y < N; ++y) {
        line.push_back(C[i][y][x]);
      }

      lines[i].push_back(line);
    }

    {
      vector<int> line;

      for (int j = 0; j < N; ++j) {
        line.push_back(C[i][j][j]);
      }

      lines[i].push_back(line);
    }

    {
      vector<int> line;

      for (int j = 0; j < N; ++j) {
        line.push_back(C[i][j][N - j - 1]);
      }

      lines[i].push_back(line);
    }
  }

  vector<int> ids[50000];
  int LS = 2 * N + 2;

  for (int i = 0; i < M; ++i) {
    for (int j = 0; j < lines[i].size(); ++j) {
      int id = i * LS + j;

      for (int v : lines[i][j]) {
        ids[v].push_back(id);
      }
    }
  }

  int ans = 2 * N - 1;
  map<int, map<int, int>> counter;

  for (int v = 0; v <= N * N * M; ++v) {
    int len = ids[v].size();

    for (int i = 0; i < len; ++i) {
      int id1 = ids[v][i];

      for (int j = i + 1; j < len; ++j) {
        int id2 = ids[v][j];
        if (id1 / LS == id2 / LS) continue;

        counter[id1][id2]++;
        counter[id2][id1]++;
        ans = min(ans, 2 * N - 1 - counter[id1][id2]);
      }
    }
  }

  cout << ans << endl;

  return 0;
}