#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,-1,0,1,1,1,-1,-1,0};
const ll dx[9]={-1,0,1,0,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll n;cin >> n;ll m;cin >> m;
    vector<vector<ll>> x(2),y(2);
    rep(i,m){
        ll a,b;cin >> a >> b;a--;b--;
        ll d=(a+b)%2;
        x[d].emplace_back(a+b);
        y[d].emplace_back(a-b);
    }
    rep(i,2){
        sort(all(x[i]));x[i].erase(unique(all(x[i])),x[i].end());
        sort(all(y[i]));y[i].erase(unique(all(y[i])),y[i].end());
    }
    ll ans=0;
    rep(d,2){
        for(auto p:x[d]){
            //[-p,p]
            ll q=min(p,(n*2-2)-p);
            ans-=upper_bound(all(y[d]),q)-lower_bound(all(y[d]),-q);
        }
        for(auto p:x[d])ans+=min(p,(n*2-2)-p)+1;
        for(auto p:y[d])ans+=n-abs(p);
        //for(auto p:x[d])cout << p <<" ";cout << endl;
        //for(auto p:y[d])cout << p << " ";cout << endl;
        /*for(auto p:x[d]){
            //[-p,p]
            cout << upper_bound(all(y[d]),p)-lower_bound(all(y[d]),-p) << endl;
        }*/
    }
    cout << ans << endl;
}