#include <bits/stdc++.h>
using namespace std;
int n, p1, p2, p3, t1, t2, a[105], b[105];
int main() {
  scanf("%d %d %d %d %d %d", &n, &p1, &p2, &p3, &t1, &t2);
  for (int i = 0; i < n; i++) scanf("%d %d", &a[i], &b[i]);
  int ans = (b[0] - a[0]) * p1;
  for (int i = 1; i < n; i++) {
    int temp = a[i] - b[i - 1];
    if (temp >= t1) {
      ans += t1 * p1;
      temp -= t1;
      if (temp - t2 >= 0) {
        ans += p2 * t2;
        temp -= t2;
        ans += p3 * temp;
      } else
        ans += temp * p2;
    } else
      ans += temp * p1;
    ans += (b[i] - a[i]) * p1;
  }
  printf("%d\n", ans);
  return 0;
}
