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

using namespace std;

ifstream fin("tribute.in");
ofstream fout("tribute.out");
int x[50005],y[50005],n,a,b,s,dx,dy;
int main()
{
    fin>>n>>a>>b;
    for(int i=1;i<=n;i++)
        fin>>x[i]>>y[i];
    sort(x+1,x+n+1);
    sort(y+1,y+n+1);
    for(int i=1;i<=n/2;i++){
        s+=max(x[n-i+1]-x[i]-a,0);
        s+=max(y[n-i+1]-y[i]-b,0);
    }
    fout<<s;
    return 0;
}