#include <bits/stdc++.h>
using namespace std;
int ss[100005];
int s[100005];
int sum[100005];
int main() {
  int prel, prer, preQl, preQr;
  int n, l, r, Ql, Qr;
  cin >> n >> prel >> prer >> preQl >> preQr;
  for (int i = 0; i < n; i++) cin >> ss[i];
  if (prel <= prer) {
    l = prel;
    r = prer;
    Ql = preQl;
    Qr = preQr;
    for (int i = 0; i < n; i++) s[i] = ss[i];
  } else {
    l = prer;
    r = prel;
    Ql = preQr;
    Qr = preQl;
    for (int i = 0; i < n; i++) s[i] = ss[n - i - 1];
  }
  sum[0] = s[0];
  for (int i = 1; i < n; i++) sum[i] = sum[i - 1] + s[i];
  int il = 0, ir = n - 1;
  int ans = 0x7fffffff, now = 0;
  while (1) {
    now += s[il] * l;
    il++;
    if (il > ir) {
      if (now < ans) ans = now;
      break;
    }
    int x = l * (sum[ir] - sum[il - 1]) + Ql * (ir - il + 1);
    if (now + x < ans) ans = now + x;
    now += r * s[ir];
    ir--;
    if (il > ir) {
      if (now < ans) ans = now;
      break;
    }
  }
  cout << ans << endl;
}
