#include <bits/stdc++.h>

using namespace std;

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

const int NMax = 50005;
const int LIM = 2000000000;

int A[NMax];
int B[NMax];

int main() {

    ios::sync_with_stdio();
    fin.tie(NULL);

    int n, dx, dy;
    fin >> n >> dx >> dy;

    for(int i = 1; i <= n; i++) fin >> A[i] >> B[i];

    sort(A + 1, A + n + 1);
    sort(B + 1, B + n + 1);

    int ans = 0;
    for(int i = 1; i <= n / 2; i++) {
        ans += max(A[n - i + 1] - A[i] - dx, 0);
        ans += max(B[n - i + 1] - B[i] - dy, 0);
    }

    fout << ans;
    return 0;
}