#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
const int N = 210;

int c[N][N][N];
set<int> s[4 * N][4 * N];

signed main()
{
//	freopen("bingo.in","r",stdin);
//	freopen("bingo.out","w",stdout);
	int n, m;
	cin >> n >> m;
	for (int i = 0; i < m; i ++ )
		for (int j = 0; j < n; j ++ )
			for (int k = 0; k < n; k ++ ) cin >> c[i][j][k];
	for (int i = 0; i < m; i ++ )
	{
		for (int j = 0; j < n; j ++ )
			s[i][2 * n].insert(c[i][j][j]),
			s[i][2 * n + 1].insert(c[i][n - 1 - j][j]);
		for (int j = 0; j < n; j ++ )
			for (int k = 0; k < n; k ++ )
				s[i][j].insert(c[i][j][k]),
				s[i][n + j].insert(c[i][k][j]);
	}
	int res = 2 * n;
	for (int i = 0; i < m; i ++ )
		for (int j = i + 1; j < m; j ++ )
			for (int k = 0; k < 2 * n + 2; k ++ )
				for (int l = 0; l < 2 * n + 2; l ++ )
				{
					int cur = 0;
					for (auto T : s[j][l]) cur += s[i][k].count(T);
					res = min(res, (n - cur) * 2 + cur - 1);
				}
	cout << res << "\n";
    return 0;
}