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 = input().split() 
n = int(n)
p = int(p)
q = int(q)
r = int(r)
ls = list(map(int,input().split()))
ans = -9223372036854775807
ls1 = [None]*n
ls2 = [None]*n
ls3 = [None]*n
ls5 = [None]*n
ls4 = [[None] * n for i in range(3)]

for i in range(0,n):
    ls1[i]=p*ls[i]
    ls2[i]=r*ls[i]
    ls5[i]=q*ls[i]

ls3[n-1] = n-1

for i in range(0,n-1):
    #print(ls2[n-i-2])
    if ls2[n-i-2] > ls2[n-i-2+1]:
        ls3[n-i-2] = n-i-2
    else:
        ls3[n-i-2] = ls3[n-i-2+1]

ls4[0][0] = ls1[0]
ls4[1][0] = ls5[0]+ls1[0]
ls4[2][0] = ls2[ls3[0]]
#print(ls4[0][0])
#print(ls4[1][0])
#print(ls4[2][0])
ans = max(ans,ls4[1][0]+ls4[2][0])
#print(ans)

for i in range(1,n):
    ls4[0][i] = max(ls4[0][i-1],ls1[i])
    ls4[1][i] = max(ls4[1][i-1],ls4[0][i]+ls5[i])
    ls4[2][i] = ls2[ls3[i]]
    ans = max(ans,ls4[1][i]+ls4[2][i])
    #print(ans)
    
print(ans)