from bisect import bisect_left
import sys
input = sys.stdin.readline

N, M = map(int, input().split())
X = [set(), set()]
Y = [set(), set()]
for _ in range(M):
    x, y = map(int, input().split())
    x -= 1
    y -= 1
    r = (x + y) % 2
    X[r].add((x + y) // 2)
    Y[r].add((x - y) // 2)
ans = 0
for i in range(2):
    X[i] = list(X[i])
    X[i].sort()
    Y[i] = list(Y[i])
    Y[i].sort()
    for y in Y[i]:
        if i == 0:
            ans += N-2*abs(y)
        else:
            if y >= 0:
                ans += N-1-2*y
            else:
                ans += N-1+2*(y+1)
    for x in X[i]:
        z = min(x, N-i-1-x)
        b, t = -z-i, z+1  # inclusive, exclusive
        ans += 2*z+1+i
        ans -= bisect_left(Y[i], t) - bisect_left(Y[i], b)
print(ans)