#include <bits/stdc++.h>

using namespace std;

const int MAXN = 50000;

int x[MAXN + 1], y[MAXN + 1];

int n, dx, dy;

FILE *fin, *fout;

int main() {
  int sol, i;
  fin = fopen ("tribute.in", "r");
  fout = fopen ("tribute.out", "w");
  fscanf (fin, "%d%d%d", &n, &dx, &dy);
  for (i = 1; i <= n; i++)
    fscanf (fin, "%d%d", &x[i], &y[i]);
  sort (x + 1, x + n + 1);
  sort (y + 1, y + n + 1);
  sol = 0;
  for (i = 1; i <= n / 2; i++) {
    sol = sol + max (x[n - i + 1] - x[i] - dx, 0) + max (y[n - i + 1] - y[i] - dy, 0);
  }
  fprintf (fout, "%d", sol);
  fclose (fin);
  fclose (fout);
  return 0;
}