Professor Dumbledore is helping Harry destroy the Horcruxes. He went to Gaunt Shack as he suspected a Horcrux to be present there. He saw Marvolo Gaunt's Ring and identified it as a Horcrux. Although he destroyed it, he is still affected by its curse. Professor Snape is helping Dumbledore remove the curse. For this, he wants to give Dumbledore exactly x drops of the potion he made. 

Value of x is calculated as maximum of p·ai + q·aj + r·ak for given p, q, r and array a1, a2, ... an such that 1 ≤ i ≤ j ≤ k ≤ n. Help Snape find the value of x. Do note that the value of x may be negative.

Input

First line of input contains 4 integers n, p, q, r ( - 109 ≤ p, q, r ≤ 109, 1 ≤ n ≤ 105).

Next line of input contains n space separated integers a1, a2, ... an ( - 109 ≤ ai ≤ 109).

Output

Output a single integer the maximum value of p·ai + q·aj + r·ak that can be obtained provided 1 ≤ i ≤ j ≤ k ≤ n.

Examples

Input

5 1 2 3
1 2 3 4 5


Output

30


Input

5 1 2 -3
-1 -2 -3 -4 -5


Output

12

Note

In the first sample case, we can take i = j = k = 5, thus making the answer as 1·5 + 2·5 + 3·5 = 30.

In second sample case, selecting i = j = 1 and k = 5 gives the answer 12.
#include <bits/stdc++.h>
using namespace std;
int tx[] = {0, 0, 1, -1};
int ty[] = {-1, 1, 0, 0};
template <class T>
T gcd(T a, T b) {
  if (b == 0) {
    return a;
  }
  return gcd(b, a % b);
}
int toInt(string& s) {
  stringstream ss(s);
  int x;
  ss >> x;
  return x;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  long long p[100000], q[100000], r[100000], x, a, b, c, ans;
  cin >> n >> a >> b >> c;
  for (int i = 0; i < n; ++i) {
    cin >> x;
    p[i] = x * a;
    q[i] = x * b;
    r[i] = x * c;
  }
  for (int i = 1; i < n; ++i) p[i] = max(p[i], p[i - 1]);
  for (int i = n - 2; i >= 0; --i) r[i] = max(r[i], r[i + 1]);
  ans = p[0] + q[0] + r[0];
  for (int i = 1; i < n; ++i) {
    ans = max(ans, p[i] + q[i] + r[i]);
  }
  cout << ans << '\n';
}
