#include <fstream>
#include<algorithm>
using namespace std;
ifstream f("tribute.in");
ofstream g("tribute.out");
int n,dx,dy,x[50003],y[50003];
long long sol;
int main()
{
    int i,j;
    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<=n && j>=1)
    {
        if(x[i]-x[j]-dx>0) sol+=x[i]-x[j]-dx;
        if(y[i]-y[j]-dy>0) sol+=y[i]-y[j]-dy;
        i++; j--;
    }
    g<<sol<<'\n';
    f.close();
    g.close();
    return 0;
}