#include <fstream>
#include <algorithm>
#include <iostream>
using namespace std;
int lin[500001], col[500001];
int rez(int v[], int n, int dx){
    int i, x1, x2, m, s=0;
    m=v[n/2];
    x1=n/2-1;
    x2=(n+1)/2;
    for(i=0;i<n/2;i++){
        s+=((v[x2]-v[x1]-dx)>0)*(v[x2]-v[x1]-dx);
        //cout<<v[x2]<<' '<<v[x1]<<' '<<((v[x2]-v[x1]-dx)>0)*(v[x2]-v[x1]-dx)<<'\n';
        x1--;
        x2++;
    }
    //cout<<'\n';
    return s;
}
ifstream fin("tribute.in");
ofstream fout("tribute.out");

int main()
{
    int n, dx, dy, i, x, y, x1, x2, xd, xs;
    fin>>n>>dx>>dy;
    for(i=0;i<n;i++){
        fin>>lin[i]>>col[i];
    }
    sort(lin,lin+n);
    sort(col,col+n);
    fout<<rez(lin,n,dx)+rez(col,n,dy);
    return 0;
}