#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>

using namespace std;

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

vector<int> x, y;
int N, dx, dy;

int solve(vector<int>& x, int d) {
    sort(x.begin(), x.end());

    int ans = 0;
    for (int i = 0; i < x.size() / 2; ++i) {
        if (x[x.size() - i - 1] - x[i] <= d) break;
        ans += x[x.size() - i - 1] - x[i] - d;
    }
    return ans;
}

int main()
{
    fin >> N >> dx >> dy;
    x.resize(N); y.resize(N);
    for (int i = 0; i < N; ++i) {
        fin >> x[i] >> y[i];
    }

    fout << solve(x, dx) + solve(y, dy);

    return 0;
}