import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = (1 << 63)-1
inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

from bisect import bisect_left

n, m = LI()
ss = set()
dd = set()
for _ in range(m):
    i, j = LI1()
    ss.add(i+j)
    dd.add(i-j)
# pDB(ss,dd)

eo = [[], []]
ans = 0
for s in ss:
    ans += n-abs(n-1-s)
    eo[s & 1].append(s)
    # pDB(s,ans)
for d in dd:
    ans += n-abs(d)
    # pDB(d,ans)

eo[0].sort()
eo[1].sort()
for d in dd:
    l = max(d, -d)
    r = min(2*n-d, 2*n+d)
    if l >= r: continue
    li = bisect_left(eo[d & 1], l)
    ri = bisect_left(eo[d & 1], r)
    ans -= ri-li
    # pDB(d,l,r,li,ri,ans)

print(ans)