#include<fstream>
#include<algorithm>
using namespace std;
ifstream in("tribute.in");
ofstream out("tribute.out");

const int nmax = 50006;
int n, vx[nmax], vy[nmax], dx, dy, rasp;

int main(){
	int player_unu=0;

	in>>n>>dx>>dy;
	for(int i = 1; i<=n; i++)
	{
		in>>vx[i]>>vy[i];
	}

	sort(vx + 1, vx + n + 1);
	sort(vy + 1, vy + n + 1);

	for(int i = 1; i<=n/2; i++)
	{
		rasp += max(vx[n - i + 1] - vx[i] - dx, 0);
		rasp += max(vy[n - i + 1] - vy[i] - dy, 0);
	}

	out<<rasp<<'\n';
	return player_unu;
}