#include <cstdio>
#include <algorithm>
using namespace std;
const int NMAX = 5005;
int x[NMAX],y[NMAX];
int distanta;
int main()
{
    int n,dx,dy;
    freopen("tribute.in","r",stdin);
    freopen("tribute.out","w",stdout);
    scanf("%d %d %d ",&n,&dx,&dy);
    int i;
    for( i = 0 ; i < n ; i++)
        scanf("%d %d",&x[i],&y[i]);
    sort(x,x+n);
    sort(y,y+n);
    for( i = 0 ; i <= n/2  ; i++)
        distanta += max(x[n - i - 1] - x[i] - dx , 0) + max(y[n - i - 1] - y[i] - dy, 0);
    printf("%d ",distanta);
    return 0;
}