#include <bits/stdc++.h>

using namespace std;

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

int x[50010], y[50010], N, solution, DX, DY;

int main()
{
    fin >> N >> DX >> DY;
    for(int i = 1; i <= N; i ++)
    {
        fin >> x[i] >> y[i];
    }

    sort(x + 1, x + N + 1);
    sort(y + 1, y + N + 1);

    for(int i = 1; i <= N / 2; i ++)
    {
        solution += max(x[N - i + 1] - x[i] - DX, 0);
        solution += max(y[N - i + 1] - y[i] - DY, 0);
    }

    fout << solution;

    return 0;
}