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 = (int)1e5 + 10000;
long long int pregreatest[MAXN];
long long int presmallest[MAXN];
long long int sufflargest[MAXN];
long long int suffsmallest[MAXN];
long long int arr[MAXN];
int main() {
  long long int n, p, q, r;
  cin >> n >> p >> q >> r;
  for (int i = 1; i <= n; i += 1) {
    long long int x;
    cin >> x;
    arr[i] = pregreatest[i] = presmallest[i] = sufflargest[i] =
        suffsmallest[i] = x;
  }
  for (int i = 1; i <= n; i += 1) {
    if (i > 1) {
      pregreatest[i] = max(pregreatest[i - 1], arr[i]);
      presmallest[i] = min(presmallest[i - 1], arr[i]);
    }
  }
  for (long long int i = n; i >= 1; i -= 1) {
    if (i < n) {
      sufflargest[i] = max(sufflargest[i + 1], arr[i]);
      suffsmallest[i] = min(suffsmallest[i + 1], arr[i]);
    }
  }
  long long int ans = -3e18 - 100;
  for (int i = 1; i <= n; i += 1) {
    long long int ret = q * arr[i];
    ans = max(ans, ret + p * presmallest[i] + r * suffsmallest[i]);
    ans = max(ans, ret + p * presmallest[i] + r * sufflargest[i]);
    ans = max(ans, ret + p * pregreatest[i] + r * sufflargest[i]);
    ans = max(ans, ret + p * pregreatest[i] + r * suffsmallest[i]);
  }
  if (ans == 0) {
    cout << "0";
    return 0;
  }
  printf("%lld\n", ans);
  return 0;
}
