#include <fstream>
#include <algorithm>

using namespace std;
ifstream cin("tribute.in");
ofstream cout("tribute.out");
int N, DX, DY, l[50001], c[50001];
int main(){
    cin >> N >> DX >> DY;
    for (int i = 1; i <= N; i++)
        cin >> l[i] >> c[i];
    sort(l + 1, l + N + 1);
    sort(c + 1, c + N + 1);
    int distanta_totala = 0;
    for (int i = 1; i <= N / 2; i++){
        if (l[N - i + 1] - l[i] > DX)
            distanta_totala += l[N - i + 1] - l[i] - DX;
        if (c[N - i + 1] - c[i] > DY)
            distanta_totala += c[N - i + 1] - c[i] - DY;
    }
    cout << distanta_totala;
    return 0;
}