#include <bits/stdc++.h>
using namespace std;
const int maxn = 100003;
int n, ca, cb, qa, qb;
int q[maxn];
int main() {
  cin >> n >> ca >> cb >> qa >> qb;
  int pref = 0, suff = 0;
  for (__typeof(n) i = 0; i < (n); i++) {
    scanf("%d", &q[i]);
    suff += q[i];
  }
  int ans = 1 << 30;
  for (__typeof(n + 1) i = 0; i < (n + 1); i++) {
    int cur = pref * ca + suff * cb;
    if (i < n - i)
      cur += (n - 2 * i - 1) * qb;
    else if (i > n - i)
      cur += (2 * i - n - 1) * qa;
    ans = min(ans, cur);
    pref += q[i];
    suff -= q[i];
  }
  cout << ans;
}
