#include <bits/stdc++.h>
using namespace std;
int n;
long long p, q, r;
long long arr[200000];
long long premax[200000];
long long premin[200000];
long long sufmax[200000];
long long sufmin[200000];
int main() {
  if (fopen("test.in", "r")) {
    freopen("test.in", "r", stdin);
  }
  cin >> n >> p >> q >> r;
  for (int i = 0; i < n; i++) cin >> arr[i];
  premax[0] = arr[0];
  premin[0] = arr[0];
  sufmax[0] = arr[n - 1];
  sufmin[0] = arr[n - 1];
  for (int i = 1; i < n; i++)
    premax[i] = max(arr[i], premax[i - 1]),
    premin[i] = min(arr[i], premin[i - 1]);
  for (int i = 1; i < n; i++) sufmax[i] = max(arr[n - i - 1], sufmax[i - 1]);
  for (int i = 1; i < n; i++) sufmin[i] = min(arr[n - i - 1], sufmin[i - 1]);
  long long ans = p * arr[0] + q * arr[0] + r * arr[0];
  for (int i = 0; i < n; i++) {
    long long cand = q * arr[i];
    if (p > 0)
      cand += premax[i] * p;
    else
      cand += premin[i] * p;
    if (r > 0)
      cand += sufmax[n - i - 1] * r;
    else
      cand += sufmin[n - i - 1] * r;
    ans = max(cand, ans);
  }
  cout << ans << '\n';
  return 0;
}
