#include <bits/stdc++.h>
using namespace std;
const int inf = 1000000007;
const long long INF = 1e18;
int mod = 1000000007;
const double eps = 1e-8;
template <typename T1, typename T2>
inline bool chmin(T1& a, T2 b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool chmax(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
template <typename T, typename U>
T pow_(T a, U b) {
  return b ? pow_(a * a, b / 2) * (b % 2 ? a : 1) : 1;
}
long long modpow(long long a, long long b, long long _mod) {
  return b ? modpow(a * a % _mod, b / 2, _mod) * (b % 2 ? a : 1) % _mod : 1;
}
template <class T, class U>
ostream& operator<<(ostream& os, const pair<T, U>& p) {
  os << p.first << " " << p.second;
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const vector<T>& vec) {
  for (int i = 0; i < ((int)vec.size()); ++i) {
    if (i) os << " ";
    os << vec[i];
  }
  return os;
}
template <class T>
ostream& operator<<(ostream& os, const set<T>& s) {
  for (auto si : s) os << si << " ";
  return os;
}
template <typename T>
inline istream& operator>>(istream& is, vector<T>& v) {
  for (int j = 0; j < ((int)v.size()); ++j) is >> v[j];
  return is;
}
template <class T, class T2>
inline void add(T& a, T2 b) {
  (a += (b % mod + mod)) %= mod;
}
template <class T>
void operator+=(vector<T>& v, vector<T> v2) {
  for (int i = 0; i < ((int)v2.size()); ++i) v.emplace_back(v2[i]);
}
void solve();
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(12);
  int T;
  T = 1;
  while (T--) solve();
}
void solve() {
  int n;
  cin >> n;
  vector<long long> r(3);
  cin >> r;
  long long d;
  cin >> d;
  vector<long long> a(n + 1);
  for (int i = 1; i < (n + 1); ++i) cin >> a[i];
  vector<long long> p(n + 1), q(n + 1);
  for (int i = 1; i < (n + 1); ++i) {
    p[i] = a[i] * r[0] + r[2];
    q[i] = min((a[i] + 1) * r[0], r[1]) + r[0];
  }
  vector<long long> L(n + 2), R(n + 2);
  R[n] = min(p[n], q[n] + 2 * d);
  for (int i = n - 1; i >= 1; --i) R[i] = R[i + 1] + 2 * d + min(p[i], q[i]);
  L[0] = -d;
  for (int i = 1; i < (n + 1); ++i) {
    L[i] = L[i - 1] + d + p[i];
    chmin(L[i],
          (i - 2 >= 0 ? L[i - 2] : 0) + 4 * d + min(p[i - 1], q[i - 1]) + q[i]);
  }
  long long ans = INF;
  R[n + 1] = -d;
  for (int i = 1; i < (n + 1); ++i) {
    chmin(ans, L[i] + R[i + 1] + d);
  }
  cout << ans << '\n';
}
