#include <iostream>
#include <cstdio>
#include <algorithm>

#define NMax 50005
#define x first
#define y second

using namespace std;

pair <int, int> City[NMax];
int N, L, DP[NMax];

inline bool Compare (pair <int, int> A, pair <int, int> B)
{
    if (A.x<B.x)
    {
        return true;
    }
    if (A.x>B.x)
    {
        return false;
    }
    if (A.y<B.y)
    {
        return true;
    }
    return false;
}

inline int Dist (int i, int j)
{
    return City[j].x-City[i].x+City[j].y+City[i].y;
}

void Read ()
{
    freopen ("orase.in", "r", stdin);
    scanf ("%d %d", &L, &N);
    for (int i=1; i<=N; ++i)
    {
        scanf ("%d %d", &City[i].x, &City[i].y);
    }
}

void Print ()
{
    freopen ("orase.out", "w", stdout);
    printf ("%d\n", Dist (DP[N], N));
}

int main()
{
    Read ();
    sort (City+1, City+N+1, Compare);
    for (int i=1; i<=N; ++i)
    {
        int D1=Dist (DP[i-1], i);
        int D2=Dist (i-1, i);
        if (D1>D2)
        {
            DP[i]=DP[i-1];
        }
        else
        {
            DP[i]=i-1;
        }
    }
    Print ();
    return 0;
}