#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const double PI = acos(-1.0);
const long double eps = 1e-8;
const int mod = 1e9 + 7;
const int maxn = 3e5 + 100;
const int N = 1e6 + 1000;
const int M = 500 + 10;
const long long mm = (1LL << 32);
template <class T>
inline void read(T &x) {
  x = 0;
  char c = getchar();
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= c == '-';
  for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
  x = f ? -x : x;
}
template <class T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  T y = 1;
  int len = 1;
  for (; y <= x / 10; y *= 10) ++len;
  for (; len; --len, x %= y, y /= 10) putchar(x / y + 48);
}
long long qpow(long long a, long long b, long long mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    b >>= 1;
    a = (a * a) % mod;
  }
  return ans;
}
long long a[N], dp[N][2];
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long r1, r2, r3, d;
  int n;
  cin >> n;
  cin >> r1 >> r2 >> r3 >> d;
  for (int i = 1; i <= n; ++i) cin >> a[i];
  memset(dp, INF, sizeof(dp));
  dp[1][0] = a[1] * r1 + r3;
  dp[1][1] = min(a[1] * r1 + r1, r2);
  for (int i = 2; i <= n; ++i) {
    dp[i][0] = min(dp[i - 1][1] + 2 * d + r1 + a[i] * r1 + r3,
                   dp[i - 1][0] + a[i] * r1 + r3);
    dp[i][0] =
        min(dp[i][0], dp[i - 1][1] + 2 * d + 2 * r1 + min(a[i] * r1 + r1, r2));
    dp[i][1] = min(dp[i - 1][0] + min(a[i] * r1 + r1, r2),
                   dp[i - 1][1] + 2 * d + r1 + min(a[i] * r1 + r1, r2));
    dp[i][0] += d;
    dp[i][1] += d;
  }
  long long ans = min(dp[n][0], dp[n - 1][1] + 2 * d + r1 + a[n] * r1 + r3);
  cout << ans << endl;
  return 0;
}
