#include <bits/stdc++.h>
using namespace std;
long long arr[1000005];
bool b;
int main() {
  long long n, p1, p2, p3, t1, t2, c = 0;
  pair<long long, long long> pa[1000];
  cin >> n >> p1 >> p2 >> p3 >> t1 >> t2;
  for (int i = 0; i < n; i++) {
    cin >> pa[i].first >> pa[i].second;
  }
  sort(pa, pa + n);
  for (int i = 0; i < n; i++) {
    if (i != n - 1)
      pa[i].second += min((long long)t1, (pa[i + 1].first - pa[i].second));
    if (i != 0) arr[i] = pa[i].first - pa[i - 1].second;
    c += (pa[i].second - pa[i].first) * p1;
  }
  for (int i = 0; i < n; i++) {
    c += min(arr[i], t2) * p2;
    arr[i] -= min(arr[i], t2);
    c += arr[i] * p3;
  }
  cout << c << endl;
}
