#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;
int n,i,j,dx,dy,s,x[50005],y[50005];
ifstream f("tribute.in");
ofstream g("tribute.out");

int main()
{
    f>>n>>dx>>dy;
    for(i=1;i<=n;i++) f>>x[i]>>y[i];
    sort(x+1,x+n+1);
    sort(y+1,y+n+1);
    i=1;j=n;
    while(i<=j)
    {
        if(x[j]-x[i]-dx>0) s+=x[j]-x[i]-dx;
        if(y[j]-y[i]-dy>0) s+=y[j]-y[i]-dy;
        i++;
        j--;
    }
    g<<s<<'\n';
    return 0;
}