//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound
using namespace std;
typedef long long ll;
//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e18 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }
ll zxc = 1, cnt[5];
void solve() {
ll n, k;
cin >> n >> k;
if(!k) {
ll ans = (n / 2 * (n + 1) / 2) * 2;
for(ll i = 2; i * i <= n; i++) {
if(!(n % i)) {
ans = min(ans, (i / 2 * (i + 1) / 2) * 2 * sq(n / i));
ll j = n / i;
ans = min(ans, (j / 2 * (j + 1) / 2) * 2 * sq(n / j));
}
}
cout << ans;
return;
}
while(k--) {
ll x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
cnt[(x1 + y1) % 2]++;
}
ll x = (n + 1) / 2 * ((n + 1) / 2) + (n / 2) * (n / 2);
cout << min(x - cnt[0] + cnt[1], (sq(n) - x) - cnt[1] + cnt[0]);
}
int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
cin.tie(0);
/*
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
*/
// cin >> zxc;
while(zxc--) {
solve();
}
return 0;
}
// さよならさ いかなくちゃ
