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;
const int maxn = 1e5 + 5;
long long arr[maxn], kiri[maxn], kanan[maxn];
long long n, a, b, c;
int main() {
  cin >> n >> a >> b >> c;
  for (int x = 1; x <= n; x++) cin >> arr[x];
  for (int x = 1; x <= n; x++) {
    kiri[x] = max(kiri[x - 1], arr[x] * a);
    if (x == 1) kiri[x] = arr[x] * a;
  }
  for (int x = n; x >= 1; x--) {
    kanan[x] = max(kanan[x + 1], arr[x] * c);
    if (x == n) kanan[x] = arr[x] * c;
  }
  long long ans = -4000000000000000000;
  for (int x = 1; x <= n; x++) {
    ans = max(ans, kiri[x] + arr[x] * b + kanan[x]);
  }
  cout << ans;
  printf("\n");
}
