#include <stdio.h>
#include <algorithm>
#include <iostream>
using namespace std;


int main()
{
    FILE * fp;
    fp = fopen("tribute.in","r");
    int n,p,dx,dy;
    fscanf(fp,"%i",&n);
    fscanf(fp,"%i",&dx);
    fscanf(fp,"%i",&dy);
    int arr_x[n];
    int arr_y[n];
    for(int i = 0;i<n;i++)
    {
        fscanf(fp,"%i",&arr_x[i]);
        fscanf(fp,"%i",&arr_y[i]);
    }
    sort(arr_x,arr_x+n);
    sort(arr_y,arr_y+n);
    int s = 0;
    for(int i = 0;i<n/2;i++)
    {
        if(arr_x[n-1-i] - arr_x[i] - dx > 0)
        {
            s += arr_x[n-1-i] - arr_x[i] - dx;
        }
        if(arr_y[n-1-i] - arr_y[i] - dy > 0)
        {
            s += arr_y[n-1-i] - arr_y[i] - dy;
        }
    }
    fclose(fp);
    fp = fopen("tribute.out","w");
    fprintf(fp,"%i",s);
    printf("%i",s);
    return 0;
}