#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
///#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
/// toto -> 1
#define pb push_back
#define pii pair<int,int>
#define pll pair<ll,ll>
#define io \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define all(a) a.begin(),a.end()
#define rep(k,i,n) for(ll k=i;k<n;k++)
#define repp(k,i,n) for(ll k=n-1;k>=i;k--)
#define rech(k) for(char k='a';k<='z';k++)
#define SZ(a) (int)a.size()
#define MX(a) *max_element(all(a))
#define MN(a) *min_element(all(a))
#define SM(a) accumulate(all(a),0LL)
#define vi vector<int>
#define vl vector<long long>
#define vvl vector<vector<long long>>
#define vvi vector<vector<int>>
/// toto -> 2
const int mod = 1e9 + 7 , modd = 998244353;
typedef long long ll;
void F1(bool res) {
if(res) {
cout<<"Yes\n" ;
}
else {
cout<<"No\n" ;
}
}
struct mint{
ll val;
mint(int64_t v = 0) {
v %= mod;
if (v < 0) v += mod;
val = v;
}
mint& operator+=(const mint& other) {
val += other.val;
if (val >= mod) val -= mod;
return *this;
}
mint& operator-=(const mint& other) {
val += mod - other.val;
if (val >= mod) val -= mod;
return *this;
}
mint& operator*=(const mint& other) {
val = (int64_t)val * other.val % mod;
return *this;
}
mint& operator/=(const mint& other) {
return *this *= other.inv();
}
friend mint operator+(mint a, const mint& b) { return a += b; }
friend mint operator-(mint a, const mint& b) { return a -= b; }
friend mint operator*(mint a, const mint& b) { return a *= b; }
friend mint operator/(mint a, const mint& b) { return a /= b; }
mint pow(int64_t exp) const {
mint a = *this, res = 1;
while (exp > 0) {
if (exp & 1)
res *= a;
a *= a;
exp >>= 1;
}
return res;
}
mint inv() const {
assert(val != 0);
return pow(mod - 2);
}
friend ostream& operator<<(ostream& os, const mint& m) {
return os << m.val;
}
};
ll bp(ll n,ll m){
if(m == 0){
return 1;
}
if(m == 1){
return n%mod;
}
if(m%2==0){
return bp(n*n%mod,m/2)%mod;
}
return n*bp(n,m-1)%mod;
}
/// toto -> 3
const int N = 1e8 + 54, M = 33, inf = 1e9 + 99;
const ll inff = 1e18 + 88888;
struct pi{
int x1,y1,x2,y2;
};
void solve(){
int n, k;
cin >> n >> k;
/// n in boleni olan lari elave edirik
vi v;
for(int i=1;i<=n;i++){
if(n%i == 0){
v.pb(i);
}
}
vector<pi> a(k);
rep(i,0,k){
cin >> a[i].x1 >> a[i].y1 >> a[i].x2 >> a[i].y2;
}
ll res = inff;
for(auto &x : v){
ll tmp = (ll)(n/(2*x))*n*x;
if(n%(2*x) != 0){
tmp += ((n -1 + x + x)/(2*x))*x*x;
}
///cerr << "1 " << tmp << endl;
rep(i,0,k){
if(((a[i].x1 + x - 1) / x)%2 != ((a[i].y1 + x - 1) / x)%2){
tmp++;
}
else{
tmp--;
}
}
/// updateing
res = min(res , tmp);
tmp = (n/(2*x))*n*x;
if(n%(2*x) != 0){
tmp += (n/(2*x))*x*x;
}
///cerr << "2 " << tmp << endl;
if(tmp == 0){
continue;
}
rep(i,0,k){
if(((a[i].x1 + x - 1) / x)%2 == ((a[i].y1 + x - 1) / x)%2){
tmp++;
}
else{
tmp--;
}
}
/// updateing again
res = min(res , tmp);
}
cout << res << endl;
}
int32_t main()
{
io;
ll t=1;
/// cin>>t;
rep(_,1,t+1)
{
cerr << "Start of test case " << _ << "\n";
///cout<<"Case #"<<_<<": ";
solve();
cerr << endl;
cerr << endl;
}
return 0;
}
