#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main(){
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  
  ll n,m;
  cin>>n>>m;
  vector<ll> X(m),Y(m);
  rep(i,m) cin>>X[i]>>Y[i];
  
  set<ll> se1,se2,so1,so2;
  ll ans=0;
  rep(i,m){
    if((X[i]+Y[i])%2){
      ll a=0,b=0;
      if(so1.count(X[i]+Y[i])==0){
        if(X[i]+Y[i]<=n+1) a=X[i]+Y[i]-1;
        else a=2*n+1-X[i]-Y[i];
      }
      if(so2.count(X[i]-Y[i])==0){
        if(X[i]-Y[i]>=0) b=n-X[i]+Y[i];
        else b=n+X[i]-Y[i];
      }
      if(a>0 && b>0){
        ans+=a+b-1;
        ll k=abs(X[i]+Y[i]-n-1);
        ans-=distance(so2.begin(),so2.upper_bound(n-1-k))-distance(so2.begin(),so2.lower_bound(1-n+k));
        k=abs(X[i]-Y[i]);
        ans-=distance(so1.begin(),so1.upper_bound(2*n-k))-distance(so1.begin(),so1.lower_bound(2+k));
      }
      else if(a>0){
        ans+=a;
        ll k=abs(X[i]+Y[i]-n-1);
        ans-=distance(so2.begin(),so2.upper_bound(n-1-k))-distance(so2.begin(),so2.lower_bound(1-n+k));
      }
      else if(b>0){
        ans+=b;
        ll k=abs(X[i]-Y[i]);
        ans-=distance(so1.begin(),so1.upper_bound(2*n-k))-distance(so1.begin(),so1.lower_bound(2+k));
      }
      so1.insert(X[i]+Y[i]);
      so2.insert(X[i]-Y[i]);
    }
    else{
      ll a=0,b=0;
      if(se1.count(X[i]+Y[i])==0){
        if(X[i]+Y[i]<=n+1) a=X[i]+Y[i]-1;
        else a=2*n+1-X[i]-Y[i];
      }
      if(se2.count(X[i]-Y[i])==0){
        if(X[i]-Y[i]>=0) b=n-X[i]+Y[i];
        else b=n+X[i]-Y[i];
      }
      if(a>0 && b>0){
        ans+=a+b-1;
        ll k=abs(X[i]+Y[i]-n-1);
        ans-=distance(se2.begin(),se2.upper_bound(n-1-k))-distance(se2.begin(),se2.lower_bound(1-n+k));
        k=abs(X[i]-Y[i]);
        ans-=distance(se1.begin(),se1.upper_bound(2*n-k))-distance(se1.begin(),se1.lower_bound(2+k));
      }
      else if(a>0){
        ans+=a;
        ll k=abs(X[i]+Y[i]-n-1);
        ans-=distance(se2.begin(),se2.upper_bound(n-1-k))-distance(se2.begin(),se2.lower_bound(1-n+k));
      }
      else if(b>0){
        ans+=b;
        ll k=abs(X[i]-Y[i]);
        ans-=distance(se1.begin(),se1.upper_bound(2*n-k))-distance(se1.begin(),se1.lower_bound(2+k));
      }
      se1.insert(X[i]+Y[i]);
      se2.insert(X[i]-Y[i]);
    }
  }
  cout<<ans<<endl;
   
  return 0;
}