#include<iostream>
#include<algorithm>
#include<fstream>
using namespace std;
ifstream in("tribute.in");
ofstream out("tribute.out");
int n;
int x[50005];
int y[50005];
long long sol;
int dx,dy;
void Read()
{
    in>>n;
    in>>dx>>dy;
    for(int i=0;i<n;i++)
    {
        in>>x[i];
        in>>y[i];
    }

}
void Solve ()
{
    sort(x,x+n);
    sort(y,y+n);

    int i=0;
    int j=n-1;
    while(i<n&&j>=0)
    {
        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--;
    }
}
void Print()
{
    out<<sol;
}
int main()
{
    Read();
    Solve();
    Print();
}