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.
R = lambda:map(int,raw_input().split())

n,p,q,r = R()

a = R()
suff_max = []
suff_max.append(p*a[0])
for i in xrange(1,len(a)):
    suff_max.append(max(p*a[i],suff_max[i-1]))

pref_max = n*[0]
pref_max[len(a)-1] = r*a[len(a)-1]
for i in xrange(len(a)-2,-1,-1):
    pref_max[i]=max(r*a[i],pref_max[i+1])

ma = int(3*-1e9*1e9)

for i in xrange(len(a)):
    ma = max(ma,suff_max[i]+(a[i]*q)+pref_max[i])

print ma
