#include <bits/stdc++.h>
using namespace std;
int x[50001],y[50001];
int main(){
    freopen("tribute.in","r",stdin);
    freopen("tribute.out","w",stdout);
    int n,a,b,S=0;
    scanf("%d %d %d",&n,&a,&b);
    for(int i=1;i<=n;++i)
        scanf("%d %d",&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+1-i]-x[i]-a,0)+max(y[n+1-i]-y[i]-b,0);
    printf("%d\n",S);
    return 0;
}