#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("tribute.in");
ofstream g("tribute.out");
int x[50010],y[50010],dx,dy;
int main()
{
    int n,sol=0;
    f>> n >> dx >> dy;
    for(int i=0;i<n;i++)
        f>> x[i] >> y[i];
    sort(x,x+n);
    sort(y,y+n);
    int i=0,j=n-1;
    while(i<=j)
    {
        if(x[j]-x[i]-dx>0)
            sol+=x[j]-x[i]-dx;

        if(y[j]-y[i]-dy>0)
            sol+=y[j]-y[i]-dy;
        i++;
        j--;
    }
    g << sol;
    return 0;
}