#include <bits/stdc++.h>
using namespace std;
long long modexp(long long n, long long m) {
  if (m == 0)
    return 1;
  else if (m == 1)
    return n;
  else {
    long long p = modexp(n, m / 2);
    if (m % 2 == 1)
      return (((p * p) % 1000000007) * n) % 1000000007;
    else
      return (p * p) % 1000000007;
  }
}
long long exp(long long n, long long m) {
  if (m == 0) return 1;
  if (m == 1) return n;
  long long p = exp(n, m / 2);
  if (m % 2 == 1)
    return p * p * n;
  else
    return p * p;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long inv(long long n) { return modexp(n, 1000000007 - 2); }
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long factorial(long long fact[], long long n) {
  fact[0] = 1;
  fact[1] = 1;
  long long prod = 1, i;
  for (i = 2; i < n + 1; i++) {
    prod = (prod * i) % 1000000007;
    fact[i] = prod;
  }
  return prod;
}
vector<long long> parent(2e5 + 1, -1);
long long parentOf(long long u) {
  if (parent[u] == -1) return u;
  parent[u] = parentOf(parent[u]);
  return parent[u];
}
void Union(long long u, long long v) {
  long long pu = parentOf(u), pv = parentOf(v);
  parent[pv] = pu;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, n, m, q, i, j, k, l, r, ql, qr;
  cin >> n >> l >> r >> ql >> qr;
  vector<long long> w(n), wl(n), wr(n);
  for (i = 0; i < n; i++) {
    cin >> w[i];
    wl[i] = w[i] * l;
    wr[i] = w[i] * r;
    if (i > 0) {
      wl[i] += wl[i - 1];
      wr[i] += wr[i - 1];
    }
  }
  long long mincost = 1e9;
  mincost = min(mincost, wl[n - 1] + (n - 1) * ql);
  mincost = min(mincost, wr[n - 1] + (n - 1) * qr);
  for (i = 1; i < n / 2 + 1; i++) {
    mincost = min(mincost, wr[n - 1] - wr[i - 1] + wl[i - 1] +
                               max((long long)0, n - 2 * i - 1) * qr);
    mincost = min(mincost, wr[n - 1] - wr[n - i - 1] + wl[n - i - 1] +
                               max((long long)0, n - 2 * i - 1) * ql);
  }
  cout << mincost << endl;
  return 0;
}
