//Dost SEFEROĞLU
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
#define pii pair<int,int>
#define ff first
#define ss second
#define sp << " " <<
#define vi vector<int>
#define all(xx) xx.begin(),xx.end()
#define ps(xxx) cout << (xxx) << endl;
const int N = 5e2+1,inf = 1e16,MOD = 1e9+7;
int t1[400001],lazy1[400001];
struct ST {
int* t;
int* lazy;
ST(int* p1,int* p2) {
t = p1,lazy = p2;
}
inline void push(const int& node,const int& l,const int& r) {
if (!lazy[node]) return;
t[node] = (r-l+1)-t[node];
if (l != r) {
lazy[2*node]^=1;
lazy[2*node+1]^=1;
}
lazy[node] = 0;
}
void update(int node,int l,int r,int L,int R) {
push(node,l,r);
if (l > R || r < L) return;
if (l >= L && r <= R) {
lazy[node]^=1;
push(node,l,r);
return;
}
int m = (l+r) >> 1;
update(2*node,l,m,L,R),update(2*node+1,m+1,r,L,R);
t[node] = t[2*node]+t[2*node+1];
}
int query(int node,int l,int r,int L,int R) {
push(node,l,r);
if (l > R || r < L) return 0;
if (l >= L && r <= R) return t[node];
int m = (l+r) >> 1;
return query(2*node,l,m,L,R)+query(2*node+1,m+1,r,L,R);
}
void clear() {
fill(lazy,lazy+400001,0);
fill(t,t+400001,0);
}
};
void solve() {
int n,k;
cin >> n >> k;
vector<pii> upds[n+2];
for (int i=1;i<=k;i++) {
int x1,y1,x2,y2;
cin >> x1 >> y1 >> x2 >> y2;
upds[x1].push_back({y1,y2});
upds[x2+1].push_back({y1,y2});
}
vi divs;
for (int i=1;i<n;i++) if (n%i == 0) divs.push_back(i);
int ans = inf;
ST st1(t1,lazy1);
for (int d : divs) {
st1.clear();
int cur = 1;
int fl = 0;
while (cur <= n) {
if (!fl) st1.update(1,1,n,cur,cur+d-1);
cur+=d;
fl^=1;
}
int need = 0;
for (int j = 1;j<=n;j++) {
for (auto it : upds[j]) st1.update(1,1,n,it.ff,it.ss);
if (((j-1)/d)%2 == 0) need+=st1.query(1,1,n,1,n);
else need+=n-st1.query(1,1,n,1,n);
}
ans = min(ans,need);
ans = min(ans,n*n-need);
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#ifdef Dodi
freopen("in.txt","r",stdin);
freopen("out.txt","w",stdout);
#endif
int t = 1;
//cin >> t;
while (t --> 0) solve();
}
