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.
a = [int(x) for x in input().split()]
b = [int(y) for y in input().split()]
n = a[0]
p,q,r = a[1], a[2], a[3]

left = []
right = []
for i in range(n):
    left.append(b[i]*p)
    right.append(b[i]*r)

prefixMax = [0]*n
temp = -10000000000000000000
i = 0
while i < n:
    temp = max(temp,left[i])
    prefixMax[i] = temp
    i += 1

temp = -10000000000000000000
suffixMax = [0]*n
i = n - 1
while i >= 0:
    temp = max(temp, right[i])
    suffixMax[i] = temp
    i -= 1



ans = -10000000000000000000
for j in range(n):
    aJ = q*b[j]
    lMax = prefixMax[j]
    rMax = suffixMax[j]
    s = aJ + lMax + rMax
    ans = max(ans, s)
    
print(ans)