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;
int64_t *arry[3];
int main(void) {
  int64_t n, p, q, r;
  cin >> n >> p >> q >> r;
  for (int i = 0; i < 3; i++) {
    arry[i] = (int64_t *)malloc(sizeof(int64_t) * n);
  }
  for (int i = 0; i < n; i++) {
    int buf;
    cin >> buf;
    arry[0][i] = buf * p;
    arry[1][i] = buf * q;
    arry[2][i] = buf * r;
  }
  {
    int64_t *pt = (int64_t *)malloc(sizeof(int64_t) * n);
    pt[n - 1] = arry[2][n - 1];
    for (int i = n - 1; i > 0; i--) {
      pt[i - 1] = max(pt[i], arry[2][i - 1]);
    }
    free(arry[2]);
    arry[2] = pt;
  }
  {
    int64_t *pt = (int64_t *)malloc(sizeof(int64_t) * n);
    for (int i = 0; i < n; i++) {
      pt[i] = arry[1][i] + arry[2][i];
    }
    free(arry[1]);
    arry[1] = pt;
  }
  {
    int64_t *pt = (int64_t *)malloc(sizeof(int64_t) * n);
    pt[0] = *arry[0];
    for (int i = 1; i < n; i++) {
      pt[i] = max(pt[i - 1], arry[0][i]);
    }
    free(arry[0]);
    arry[0] = pt;
  }
  int64_t max = arry[0][0] + arry[1][0];
  for (int i = 1; i < n; i++) {
    int64_t buf = arry[0][i] + arry[1][i];
    if (buf > max) max = buf;
  }
  cout << max << endl;
  for (int i = 0; i < 3; i++) {
    free(arry[i]);
  }
}
