import bisect

n, m = map(int,input().split())
xy = [list(map(int,input().split())) for _ in range(m)]

plus_odd = []
plus_even = []
minus_odd = []
minus_even = []
ans = 0
x_set = set()
y_set = set()
for i in range(m):
    x, y = xy[i]
    X = x + y - 2
    Y = x - y
    if X not in x_set:
        ans += min(X, n - 1) - max(1 + X - n, 0) + 1
        x_set.add(X)
    if Y not in y_set:
        ans += min(n - 1 + Y, n - 1) - max(Y, 0) + 1
        y_set.add(Y)

for v in y_set:
    if v % 2:
        plus_odd.append(abs(v))
    else:
        plus_even.append(abs(v))
for v in x_set:
    if v % 2:
        minus_odd.append(v)
    else:
        minus_even.append(v)

minus_odd.sort()
minus_even.sort()
plus_even.sort()
plus_odd.sort()
for y in plus_odd:
    ans -= max(0, bisect.bisect(minus_odd, 2 * (n - 1) - y) - bisect.bisect(minus_odd, y - 1))
for y in plus_even:
    ans -= max(0, bisect.bisect(minus_even, 2 * (n - 1) - y) - bisect.bisect(minus_even, y - 1))
print(ans)