# include <algorithm>
# include <cstdio>

const char *FIN = "tribute.in", *FOU = "tribute.out" ;
const int MAX = 50005 ;

# define x first
# define y second

std :: pair < int, int > D ;
int A[MAX], B[MAX] ;
int N, sol ;

inline int ch ( int X ) {
    return ( X > 0 ? X : 0 ) ;
}

int main ( void ) {
    freopen ( FIN, "r", stdin ) ;

    scanf ( "%d %d %d", &N, &D.x, &D.y ) ;
    for ( int i = 0 ; i < N; ++i ) {
        scanf ( "%d %d", A + i, B + i ) ;
    }
    std :: sort ( A, A + N ) ;
    std :: sort ( B, B + N ) ;

    for ( int i = 0, j = N - 1; i <= j; ++i, --j ) {
        sol += ch ( A[j] - A[i] - D.x ) ;
        sol += ch ( B[j] - B[i] - D.y ) ;
    }

    fprintf ( fopen ( FOU, "w" ) , "%d", sol ) ;
}