#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mod2 = 998244353;
long long mod3 = 1000003;
long long mod4 = 998244853;
long long mod5 = 1000000009;
long long inf = 1LL << 61;
int iinf = 1 << 30;
double pi = 3.14159265358979323846;
double pi2 = pi / 2.0;
double eps = 1e-8;
int dh[4] = {1, 0, -1, 0};
int dw[4] = {0, 1, 0, -1};
int ddh[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
int ddw[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
struct custom_hash {
  static uint64_t splitmix64(uint64_t x) {
    x += 0x9e3779b97f4a7c15;
    x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
    x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
    return x ^ (x >> 31);
  }
  size_t operator()(uint64_t x) const {
    static const uint64_t FIXED_RANDOM =
        chrono::steady_clock::now().time_since_epoch().count();
    return splitmix64(x + FIXED_RANDOM);
  }
};
long long gcd(long long a, long long b) {
  if (a < 0) a = -a;
  if (b < 0) b = -b;
  if (a < b) swap(a, b);
  if (b == 0) return a;
  if (a % b == 0) return b;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) {
  long long c = gcd(a, b);
  return a * b / c;
}
long long Pow(long long n, long long k) {
  if (k < 0) return 0;
  long long ret = 1;
  long long now = n;
  while (k > 0) {
    if (k & 1) ret *= now;
    now *= now;
    k /= 2;
  }
  return ret;
}
long long beki(long long n, long long k, long long md) {
  long long ret = 1;
  long long now = n;
  now %= md;
  while (k > 0) {
    if (k % 2 == 1) {
      ret *= now;
      ret %= md;
    }
    now *= now;
    now %= md;
    k /= 2;
  }
  return ret;
}
long long gyaku(long long n, long long md) { return beki(n, md - 2, md); }
long long popcount(long long n) {
  long long ret = 0;
  long long u = n;
  while (u > 0) {
    ret += u % 2;
    u /= 2;
  }
  return ret;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long n, r[3], d;
  cin >> n >> r[0] >> r[1] >> r[2] >> d;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i];
  long long dp[n + 1];
  fill(dp, dp + n + 1, inf);
  long long ans = inf;
  dp[0] = 0;
  for (int i = 0; i < n; i++) {
    dp[i + 1] = min(dp[i + 1], dp[i] + r[0] * a[i] + r[2] + d);
    if (i == n - 1) {
      ans = min(ans, dp[i] + min(r[1], r[0] * (a[i] + 1)) + d + d + r[0]);
    } else if (i == n - 2) {
      ans = min(ans, dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                         r[0] * a[i + 1] + r[2] + d + r[0]);
      dp[i + 2] = min(dp[i + 2], dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 1] + 1)) + d +
                                     r[0] + d + r[0] + d);
    } else if (i == n - 3) {
      ans = min(ans, dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                         min(r[1], r[0] * (a[i + 1] + 1)) + d +
                         r[0] * a[i + 2] + r[2] + d + r[0] + d + r[0]);
      dp[i + 2] = min(dp[i + 2], dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 1] + 1)) + d +
                                     r[0] + d + r[0] + d);
      dp[i + 3] = min(dp[i + 3], dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 1] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 2] + 1)) + d + d +
                                     r[0] + d + r[0] + d + r[0] + d);
    } else {
      dp[i + 2] = min(dp[i + 2], dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 1] + 1)) + d +
                                     r[0] + d + r[0] + d);
      dp[i + 3] = min(dp[i + 3], dp[i] + min(r[1], r[0] * (a[i] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 1] + 1)) + d +
                                     min(r[1], r[0] * (a[i + 2] + 1)) + d + d +
                                     r[0] + d + r[0] + d + r[0] + d);
    }
  }
  ans = min(ans, dp[n] - d);
  cout << ans << endl;
}
