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.
def modified_pre_max(arr,p):
    n = len(arr)
    arr1 = ['None']*n
    arr1[0] = arr[0]*p
    for i in range(1,n):
        arr1[i] = max((arr1[i-1]),(arr[i]*p))
    return arr1

def modified_suf_max(arr,r):
    n = len(arr)
    arr1 = ['None'] * n
    arr1[n-1] = arr[n-1]*r
    for i in range (n-2,-1,-1):
        arr1[i] = max((arr1[i+1]),arr[i]*r)
    return arr1

n,p,q,r = map(int,input().split())
arr = list(map(int,input().split()))
ans = float("-inf")

arr_pre_max = modified_pre_max(arr,p)
arr_suf_max = modified_suf_max(arr,r)
for i in range (0,n):
    current_ans = arr_pre_max[i] + arr[i]*q + arr_suf_max[i]
    ans = max(ans,current_ans)

print(ans)
#print(arr_pre_max)
#print(arr_suf_max)








