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

premax = []
suffmax = []
for i in arr:
    premax.append(i*p)
    suffmax.append(i*r)

# print(premax)
# print(suffmax)

for i in range(1,n):
    premax[i] = max(premax[i], premax[i-1])

for i in range(2,n+1):
    suffmax[-i] = max(suffmax[-i], suffmax[-i+1])


# print(premax)
# print(suffmax)

# possibleArr = []
maxx = float('-inf')
for j in range(0,n):
    # print(max(premax[0:j+1]))
    # print(max(suffmax[j:]))
    # print(j)
    if maxx < (premax[j] + (q * arr[j]) + suffmax[j] ):
        maxx = premax[j] + (q * arr[j]) + suffmax[j]
    # possibleArr.append(max(arr[0:j])*p + (q * arr[j]) + max(arr[j:]))
# print(max(possibleArr))
print(maxx)
# print(suffmax)