#include <bits/stdc++.h>

using namespace std;

ifstream fin ("tribute.in");
ofstream fout ("tribute.out");

int n, x[50002], y[50002], d1, d2;
long long ans;

int main()
{
  fin >> n >> d1 >> d2;
  for (int i = 1; i <= n; i++)
    fin >> x[i] >> y[i];
  sort (x + 1, x + n + 1);
  sort (y + 1, y + n + 1);
  for (int i = 1; i <= n / 2; i++)
    ans += max(x[n - i + 1] - x[i] - d1, 0) + max(y[n - i + 1] - y[i] - d2, 0);
  fout << ans;
  return 0;
}