#include <bits/stdc++.h>

using namespace std;

const int BUFFER_SIZE = 1 << 20;
char rb[BUFFER_SIZE], *rp = rb, *rt = rb;
inline char read_char() {
    return rp == rt ? (rt = rb + fread(rb, 1, BUFFER_SIZE, stdin), rp = rb, *rp ++) : *rp ++;
}
inline int read_int() {
    int x = 0;
    char ch = read_char(), flag = 0;
    while (ch != '-' && (ch < '0' || ch > '9')) {
        ch = read_char();
    }
    if (ch == '-') {
        flag = 1;
        ch = read_char();
    }
    for (x = 0; ch >= '0' && ch <= '9'; ch = read_char()) {
        x = x * 10 + (ch - '0');
    }
    return flag ? -x : x;
}

const int MAX_N = 100000 + 5;

int N, X, Y, Z;
int a[MAX_N], al[MAX_N], ar[MAX_N];
long long ans;
priority_queue<pair<int,int>> pq;

int main() {
    N = read_int();
    X = read_int(), Y = read_int(), Z = read_int();
    for (int i = 1; i <= N; i ++) {
        int aa = read_int(), bb = read_int();
        a[i] = bb - aa;
        al[i] = i - 1;
        ar[i] = i + 1;
        if (i > 1 && a[i] * a[i - 1] < 0) {
            pq.push(make_pair(-1, i - 1));
        }
    }
    auto rm = [&] (int i) {
        if (al[i] >= 1) ar[al[i]] = ar[i];
        if (ar[i] <= N) al[ar[i]] = al[i];
        if (al[i] >= 1 && ar[i] <= N && a[al[i]] * a[ar[i]] < 0) {
            pq.push(make_pair(al[i] - ar[i], al[i]));
        }
    };
    while (pq.size()) {
        auto tmp = pq.top();
        pq.pop();
        int i = tmp.second, j = ar[i];
        if (j - i != -tmp.first) continue;
        if (a[i] * a[j] >= 0) continue;
        if (1ll * Z * (j - i) > X + Y) break;
        int t = min(abs(a[i]), abs(a[j]));
        ans += 1ll * Z * (j - i) * t;
        if (a[i] < 0) {
            a[i] += t, a[j] -= t;
        } else {
            a[i] -= t, a[j] += t;
        }
        if (!a[i]) rm(i);
        if (!a[j]) rm(j);
    }
    for (int i = 1; i <= N; i ++) {
        if (a[i] > 0) {
            ans += X * a[i];
        } else {
            ans -= Y * a[i];
        }
    }
    printf("%lld\n", ans);
    return 0;
}