#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("tribute.in");
ofstream fout ("tribute.out");
int N, dx, dy, sum, OX[50010], OY[50010];

int main()
{
	fin >> N >> dx >> dy;
	for (int i=1; i<=N; i++) fin >> OX[i] >> OY[i];
	
	sort (OX + 1, OX + 1 + N);
	sort (OY + 1, OY + 1 + N);
	
	for (int i=1; i<=N/2; i++)
	{
		sum += max(OX[N-i+1] - OX[i] - dx, 0);
		sum += max(OY[N-i+1] - OY[i] - dy, 0);
	}
	
	fout << sum << '\n';
	fout.close();
	return 0;
}