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.
x=raw_input().split(' ')
n=int(x[0])
p=int(x[1])
q=int(x[2])
r=int(x[3])

y=raw_input().split(' ')
i=0
arr=[]
while i<n:
    arr.append(int(y[i]))
    i=i+1

i=n-1
maxi=-(10**19)
maxi2=-(10**19)
hasMax=[0]*n
hasMax2=[0]*n
while i>=0:
    maxi=max(maxi,r*arr[i])
    hasMax[i]=maxi
    maxi2=max(maxi2,q*arr[i]+hasMax[i])
    hasMax2[i]=maxi2
    i=i-1

i=0
maxiAns=-(10**19)
while i<n:
    maxiAns=max(maxiAns,p*arr[i]+hasMax2[i])
    i=i+1

print maxiAns

    
