#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("tribute.in");
ofstream g("tribute.out");
int i,j,n,r,x,y,v1[50005],v2[50005];
int main(){
 f>>n>>x>>y;
 for(i=1;i<=n;i++){f>>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+=max(v1[j]-v1[i]-x,0);
  r+=max(v2[j]-v2[i]-y,0);
 }g<<r;
 return 0;
}