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;
void solve(int n, long long p, long long q, long long r, vector<long long> a) {
  vector<long long> ll(n), lr(n), sl(n), sr(n);
  ll[0] = a[0];
  sl[0] = a[0];
  for (int i = 1; i < n; i++) {
    ll[i] = max(ll[i - 1], a[i]);
    sl[i] = min(sl[i - 1], a[i]);
  }
  lr[n - 1] = a[n - 1];
  sr[n - 1] = a[n - 1];
  for (int i = n - 2; i >= 0; i--) {
    lr[i] = max(lr[i + 1], a[i]);
    sr[i] = min(sr[i + 1], a[i]);
  }
  long long ans = (p + q + r) * a[0];
  for (int j = 0; j < n; j++) {
    long long tmp = q * a[j];
    tmp += p * ((p > 0) ? ll[j] : sl[j]);
    tmp += r * ((r > 0) ? lr[j] : sr[j]);
    ans = max(tmp, ans);
  }
  printf("%lli\n", ans);
}
int main() {
  int n, p, q, r;
  scanf("%d %d %d %d", &n, &p, &q, &r);
  vector<long long> a(n);
  for (int i = 0; i < n; i++) scanf("%lli", &a[i]);
  solve(n, p, q, r, a);
}
