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

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

int main()
{
    fi>>n>>dx>>dy;
    for(i=1;i<=n;i++)
    fi>>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=s+x[j]-x[i]-dx;
        if(y[j]-y[i]-dy>0)
            s=s+y[j]-y[i]-dy;
        i++;
        j--;
    }
    fo<<s<<'\n';
    return 0;
}