#include <bits/stdc++.h>
using namespace std;
const int M = 1000000007;
const int MM = 998244353;
const long double PI = acos(-1);
long long power(long long b, long long e, long long m) {
  if (e == 0) return 1;
  if (e & 1) return b * power(b * b % m, e / 2, m) % m;
  return power(b * b % m, e / 2, m);
}
long long power(long long b, long long e) {
  if (e == 0) return 1;
  if (e & 1) return b * power(b * b, e / 2);
  return power(b * b, e / 2);
}
template <typename T, typename U>
static inline void amin(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
static inline void amax(T &x, U y) {
  if (x < y) x = y;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
  return os << '(' << p.first << "," << p.second << ')';
}
int _runtimeTerror_() {
  long long n, p, q, r;
  cin >> n >> p >> q >> r;
  long long ans = -8000000000000000000;
  long long a[n];
  for (int i = 0; i < n; ++i) cin >> a[i];
  long long px[n], sx[n];
  px[0] = a[0] * p;
  sx[n - 1] = a[n - 1] * r;
  for (int i = 1; i < n; ++i) px[i] = max(px[i - 1], a[i] * p);
  for (int i = n - 2; i >= 0; --i) sx[i] = max(sx[i + 1], a[i] * r);
  for (int i = 0; i < n; ++i) amax(ans, a[i] * q + px[i] + sx[i]);
  cout << ans;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) _runtimeTerror_();
  return 0;
}
