#include <bits/stdc++.h>
using namespace std;

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

const int N_MAX = 50005;

int n, dx, dy;
int x[N_MAX + 2], y[N_MAX + 2];

int ans;

int main()
{
    in >> n >> dx >> dy;
    for(int i = 1; i <= n; i++)
        in >> 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] - dx, 0);
        ans += max(y[n - i + 1] - y[i] - dy, 0);
    }

    out << ans << '\n';

    return 0;
}