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;
struct lala {
  long long a;
  bool v;
};
long long n, p, q, r, i, ans, j;
long long apa[50];
long long ar[100100];
lala arr[100100][5];
long long max3(long long a, long long b, long long c) {
  return max(max(a, b), c);
}
long long aku(long long idx, long long c) {
  if (c < 1) return 0;
  if (idx < 0 and c > 0) return -4e18;
  if (arr[idx][c].v == false) {
    arr[idx][c].a =
        max3((apa[c] * ar[idx]) + aku(idx, c - 1),
             (apa[c] * ar[idx]) + aku(idx - 1, c - 1), aku(idx - 1, c));
    arr[idx][c].v = true;
  }
  return arr[idx][c].a;
}
int main() {
  cin >> n >> p >> q >> r;
  apa[1] = p;
  apa[2] = q;
  apa[3] = r;
  for (i = 0; i < 100100; i++)
    for (j = 0; j < 5; j++) arr[i][j].v = false;
  for (i = 0; i < n; i++) cin >> ar[i];
  ans = aku(n - 1, 3);
  cout << ans << endl;
}
