#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

int main() {
    ll N, M;
    cin >> N >> M;
    vector<ll> X(M);
    vector<ll> Y(M);
    for (ll i = 0; i < M; i++) {
        cin >> X[i] >> Y[i];
    }
    // パリティの異なるもの同士が交わらない
    // とりあえず全部 X + Y 方面に置いておこう
    ll ans = 0;
    set<ll> odds;
    set<ll> evens;
    for (ll i = 0; i < M; i++) {
        if ((X[i] + Y[i]) % 2 == 1) {
            if (odds.find(X[i] + Y[i]) == odds.end()) {
                ans += min((X[i] + Y[i]) - 1, 2 * N + 1 - (X[i] + Y[i]));
                odds.insert(X[i] + Y[i]);
            }
        } else {
            if (evens.find(X[i] + Y[i]) == evens.end()) {
                ans += min((X[i] + Y[i]) - 1, 2 * N + 1 - (X[i] + Y[i]));
                evens.insert(X[i] + Y[i]);
            }
        }
    }
    vector<ll> odd_vec(0);
    vector<ll> even_vec(0);
    for (auto it = odds.begin(); it != odds.end(); it++) {
        odd_vec.push_back(*it);
    }
    for (auto it = evens.begin(); it != evens.end(); it++) {
        even_vec.push_back(*it);
    }

    set<ll> odds2;
    set<ll> evens2;
    for (ll i = 0; i < M; i++) {
        if ((X[i] + Y[i]) % 2 == 1) {
            if (odds2.find(X[i] - Y[i]) == odds2.end()) {
                ll diffs = abs(X[i] - Y[i]);
                ll lb = diffs + 2;
                ll ub = 2 * N - diffs;
                auto lit = lower_bound(all(odd_vec), lb);
                auto uit = lower_bound(all(odd_vec), ub + 1);
                ll lid = lit - odd_vec.begin();
                ll uid = uit - odd_vec.begin();
                ans += ((ub - lb) / 2 + 1 - (uid - lid));
                odds2.insert(X[i] - Y[i]);
            }
        } else {
            if (evens2.find(X[i] - Y[i]) == evens2.end()) {
                if (X[i] == Y[i]) {
                    ans += N - even_vec.size();
                } else {
                    ll diffs = abs(X[i] - Y[i]);
                    ll lb = diffs + 2;
                    ll ub = 2 * N - diffs;
                    auto lit = lower_bound(all(even_vec), lb);
                    auto uit = lower_bound(all(even_vec), ub + 1);
                    ll lid = lit - even_vec.begin();
                    ll uid = uit - even_vec.begin();
                    ans += ((ub - lb) / 2 + 1 - (uid - lid));
                }
                evens2.insert(X[i] - Y[i]);
            }
        }
    }
    cout << ans << endl;
}