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 long long int N = 1e5 + 5;
const long long int INF = 9e18;
const long long int mod = 1e9 + 7;
long long int n, p, q, r, a[N], seg[4 * N], segx[4 * N];
void build(long long int low, long long int high, long long int pos) {
  if (low == high) {
    seg[pos] = a[low];
    return;
  }
  long long int mid = (low + high) / 2;
  build(low, mid, 2 * pos + 1);
  build(mid + 1, high, 2 * pos + 2);
  seg[pos] = min(seg[2 * pos + 1], seg[2 * pos + 2]);
}
void buildx(long long int low, long long int high, long long int pos) {
  if (low == high) {
    segx[pos] = a[low];
    return;
  }
  long long int mid = (low + high) / 2;
  buildx(low, mid, 2 * pos + 1);
  buildx(mid + 1, high, 2 * pos + 2);
  segx[pos] = max(segx[2 * pos + 1], segx[2 * pos + 2]);
}
long long int query(long long int low, long long int high, long long int qlow,
                    long long int qhigh, long long int pos) {
  if (qlow > high || qhigh < low) return INF;
  if (qlow <= low && qhigh >= high) return seg[pos];
  long long int mid = (low + high) / 2;
  return min(query(low, mid, qlow, qhigh, 2 * pos + 1),
             query(mid + 1, high, qlow, qhigh, 2 * pos + 2));
}
long long int queryx(long long int low, long long int high, long long int qlow,
                     long long int qhigh, long long int pos) {
  if (qlow > high || qhigh < low) return -INF;
  if (qlow <= low && qhigh >= high) return segx[pos];
  long long int mid = (low + high) / 2;
  return max(queryx(low, mid, qlow, qhigh, 2 * pos + 1),
             queryx(mid + 1, high, qlow, qhigh, 2 * pos + 2));
}
int main() {
  long long int omaxi = -INF;
  cin >> n >> p >> q >> r;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
  }
  build(0, n - 1, 0);
  buildx(0, n - 1, 0);
  for (long long int i = 0; i < n; i++) {
    long long int x = q * a[i];
    if (p < 0) {
      long long int mini = query(0, n - 1, 0, i, 0);
      x += (p * mini);
    } else {
      long long int maxi = queryx(0, n - 1, 0, i, 0);
      x += (p * maxi);
    }
    if (r < 0) {
      long long int mini = query(0, n - 1, i, n - 1, 0);
      x += (r * mini);
    } else {
      long long int maxi = queryx(0, n - 1, i, n - 1, 0);
      x += (r * maxi);
    }
    omaxi = max(omaxi, x);
  }
  cout << omaxi << endl;
}
