#include <fstream>
#include <algorithm>

using namespace std;

ifstream f("tribute.in");
ofstream g("tribute.out");
int n, dx, dy;
int x[50005];
int y[50005];

int distx()
{
    int st = 1;
    int dr = n;
    int sum = 0;
    while(st <= dr && x[dr] - x[st] >= dx)
    {
        sum += x[dr] - x[st] - dx;
        st++;
        dr--;
    }
    return sum;
}

int disty()
{
    int st = 1;
    int dr = n;
    int sum = 0;
    while(st <= dr && y[dr] - y[st] >= dy)
    {
        sum += y[dr] - y[st] - dy;
        st++;
        dr--;
    }
    return sum;
}

int main()
{
    f>>n>>dx>>dy;
    for(int i = 1; i<=n; i++)
    {
        f>>x[i]>>y[i];
    }

    sort(x+1, x+n+1);
    sort(y+1, y+n+1);

    g<<(long long)(distx() + disty());
    return 0;
}