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.
n,p,q,r = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))

max1 = {}
min1 = {}
max2 = {}
min2 = {}
maxval1 = a[0]
minval1 = a[0]
maxval2 = a[n-1]
minval2 = a[n-1]

for i in range(n):
  j = n-1-i
  maxval1 = max(maxval1, a[i])
  max1[i] = maxval1
  minval1 = min(minval1, a[i])
  min1[i] = minval1
  maxval2 = max(maxval2, a[j])
  max2[j] = maxval2
  minval2 = min(minval2, a[j])
  min2[j] = minval2


x = None
for i in range(n):
  y = q*a[i]
  if p > 0:
    y += p*max1[i]
  else:
    y += p*min1[i]
  if r > 0:
    y += r*max2[i]
  else:
    y += r*min2[i]
  if x is None or x < y:
    x = y

print(x)