#include <iostream>
#include <unordered_map>
#include <vector>
#include <algorithm>

using namespace std ;

int main()
{

    int m, n, leftmin = 1e9, rightmax = 0, x, y ;

    cin >> m >> n ;

    for (int i = 1 ; i <= n ; i ++)
    {

        cin >> x >> y ;

        leftmin = min (leftmin, x - y) ;
        rightmax = max (rightmax, x + y) ;

    }

    cout << rightmax - leftmin ;

    return 0 ;
}