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 + 100;
long long n, params[4], dp[maxN][4], maxNum[maxN];
int main() {
  std::ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> params[1] >> params[2] >> params[3];
  memset(maxNum, -0x3f3f3f3f, sizeof(maxNum));
  for (int i = 1; i <= n; i++) {
    cin >> dp[i][0];
  }
  for (int i = 1; i <= 3; i++) {
    for (int j = 1; j <= n; j++) {
      if (i == 1) {
        dp[j][i] = dp[j][0] * params[i];
      } else {
        dp[j][i] = dp[j][0] * params[i] + maxNum[j];
      }
      maxNum[j] = max(maxNum[j - 1], dp[j][i]);
    }
  }
  cout << maxNum[n] << endl;
  return 0;
}
