#include <bits/stdc++.h>
using namespace std;
int calc(vector<vector<int>>& A,vector<vector<int>>& B,int N,int M){
    vector<vector<int>> a(2*N+2,vector<int>(N)),b(2*N+2,vector<int>(N));
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            a[i][j]=A[i][j];
            b[i][j]=B[i][j];
            a[i+N][j]=A[j][i];
            b[i+N][j]=B[j][i];
        }
    } 
    for(int i=0;i<N;i++){
        a[2*N][i]=A[i][i];
        a[2*N+1][i]=A[i][N-1-i];
        b[2*N][i]=B[i][i];
        b[2*N+1][i]=B[i][N-1-i];
    }
    int ret=2*N-1;
    int temp;
    map<int,int> m;
    for(int i=0;i<2*N+2;i++){
        for(int j=0;j<2*N+2;j++){
            temp=2*N-1;
            m.clear();
            for(int k=0;k<N;k++){
                m[a[i][k]]=1;
            }
            for(int k=0;k<N;k++){
                temp-=m.count(b[j][k]);
            }
            ret=min(ret,temp);
        }
    }
    return ret;
}

int main(){
    int N,M;
    cin>>N>>M;
    vector<vector<vector<int>>> cards(M,vector<vector<int>>(N,vector<int>(N)));
    for(int i=0;i<M;i++){
        for(int j=0;j<N;j++){
            for(int k=0;k<N;k++){
                cin>>cards[i][j][k];
            }
        }
    }
    int ans=INT_MAX;
    for(int i=0;i<M-1;i++){
        for(int j=i+1;j<M;j++){
            ans=min(ans,calc(cards[i],cards[j],N,M));
        }
    }
    cout<<ans<<endl;
}