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 INF = 0x3f3f3f3f;
const double PI = acos(-1.0);
const long long inf = 3e18;
const int N = 1e5 + 5;
int n;
long long v[N], a[N];
long long dp[5][N];
bool vis[5][N];
long long go(int i, int j) {
  if (i >= 3) return 0;
  if (j >= n) return -inf;
  if (vis[i][j] == 1) return dp[i][j];
  vis[i][j] = 1;
  long long L = go(i + 1, j) + v[i] * a[j];
  long long R = go(i, j + 1);
  return dp[i][j] = max(L, R);
}
int main(void) {
  ios_base::sync_with_stdio(false);
  cin >> n;
  cin >> v[0] >> v[1] >> v[2];
  for (int i = 0; i < n; i++) cin >> a[i];
  cout << go(0, 0) << endl;
  return 0;
}
