#include <bits/stdc++.h>

using namespace std;

#define FNAME "test"

typedef long long ll;

const int N = 1e6 + 5;
const ll INF = 1e18;

#define llpair pair<ll,ll>
#define fi first
#define se second

int n;
ll a,b,c;
ll x[N];
ll pre[N];
ll dp[N];
vector<llpair> st;

void Task() {
	ios_base::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cout << fixed << setprecision(9);
	if (fopen(FNAME".inp","r")) {
		freopen(FNAME".inp","r",stdin);
		freopen(FNAME".out","w",stdout);
	}
}

ll f(ll x) {
	return a * x * x + b * x + c;
}

bool can_remove(llpair l1, llpair l2, llpair l3) {
	return ((l2.se - l1.se) * (l1.fi - l3.fi) <= (l3.se - l1.se) * (l1.fi - l2.fi));
}

void add(llpair newline) {
	while (st.size() >= 2 && can_remove(st[st.size() - 2], st[st.size() - 1], newline)) st.pop_back();
	st.push_back(newline);
}

ll fvalue(ll x, llpair d) {
	return d.fi * x + d.se;
}

ll query(ll x) {
	ll ans = -INF;
	for (auto line : st) ans = max(ans, fvalue(x, line));
	return ans;
}


void Solve() {
	//Your Code
	cin >> n;
	for (int i = 1; i <= n; i++) cin >> x[i];
	cin >> a >> b >> c;
	pre[0] = 0; dp[0] = 0;
	for (int i = 1; i <= n; i++) {
		pre[i] = pre[i - 1] + x[i];
		dp[i] = f(pre[i]);
	}
	st.push_back({0LL, 0LL});
	for (int i = 1; i <= n; i++) {
		dp[i] += query(pre[i]);
		if (i < n) add({-2LL * a * pre[i], dp[i] + a * pre[i] * pre[i] - b * pre[i]});
	}
	cout << dp[n] << '\n';
}

int main() {
	Task();
	Solve();
	cerr << "\nTime run: " << 1000*clock()/CLOCKS_PER_SEC << "ms";
	return 37^37;
}