#include <bits/stdc++.h>
using namespace std;
ifstream fin("tribute.in");
ofstream fout("tribute.out");
int point_x[50001], point_y[50001];

int main() {
    int n, dx, dy, ans = 0;
    fin >> n >> dx >> dy;
    for (int i = 0; i < n; ++i) {
        fin >> point_x[i] >> point_y[i];
    }
    sort(point_x, point_x + n);
    sort(point_y, point_y + n);
    for(int i = 0; i < n / 2; i++) {
        ans += max(0, point_x[n - i - 1] - point_x[i] - dx);
        ans += max(0, point_y[n - i - 1] - point_y[i] - dy);
    }
    fout << ans;
}