N,M=map(int,input().split())
X=[list(map(int,input().split())) for i in range(M)]
A=[]
B=[]
for i in range(M):
  A.append(X[i][0]+X[i][1]-N-1)
  B.append(X[i][0]-X[i][1])
A=sorted(set(A))
B=sorted(set(B))
def f(X,Y):
  for i in range(len(X)):
    X[i]=abs(X[i])
  for i in range(len(Y)):
    Y[i]=abs(Y[i])
  X=sorted(X)
  Y=sorted(Y)
  ANS=0
  v=len(Y)
  for i in range(len(X)):
    while v!=0:
      if X[i]+Y[v-1]>=N:
        v-=1
      else:
        break
    ANS+=v
  return ANS

C=[[],[]]
D=[[],[]]
ANS=0
for i in range(len(A)):
  C[A[i]&1].append(A[i])
  ANS+=N-abs(A[i])
for i in range(len(B)):
  D[B[i]&1].append(B[i])
  ANS+=N-abs(B[i])
if N&1:
  D[0],D[1]=D[1][:],D[0][:]
print(ANS-(f(C[0],D[1])+f(C[1],D[0])))