#include <fstream>
#include <algorithm>

using namespace std;

ifstream cin ("tribute.in");
ofstream cout ("tribute.out");

#define MaxN 50002

int x[MaxN], y[MaxN];

int main()
{
    int n, dx, dy, p;
    cin >> n >> dx >> dy;
    for (int i = 1; i <= n; i ++)
    {
        cin >> x[i] >> y[i];
    }
    sort(x + 1, x + n + 1);
    sort(y + 1, y + n + 1);
    long long sol = 0;
    for (int st = 1, dr = n; st <= dr; st ++, dr --)
    {
        p = x[dr] - x[st] - dx;
        sol += (p > 0 ? p : 0);
        p = y[dr] - y[st] - dy;
        sol += (p > 0 ? p : 0);
    }
    cout << sol << '\n';
    return 0;
}