#include <stdio.h>
#include <algorithm>

using namespace std;

FILE *f,*s;

int i,j,n,r,x,y;

int v1[50005],v2[50005];

int Functie(int x) 
{
	return (x>0?x:0);
}

int main()
{
	f=fopen("tribute.in","r");
	s=fopen("tribute.out","w");
	
	fscanf(f,"%d %d %d",&n,&x,&y);
	
	for(i=1;i<=n;i++)
		fscanf(f,"%d %d",&v1[i],&v2[i]);
	
	sort(v1+1,v1+n+1);
	sort(v2+1,v2+n+1);
	
	for(i=1,j=n;i<=j;++i,--j) 
	{
		r+=Functie(v1[j]-v1[i]-x);
		r+=Functie(v2[j]-v2[i]-y);
	}
	
	fprintf(s,"%d",r);
	
	return 0;
}