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, q, s, r = list(map(int, input().split()))
a = list(map(int, input().split()))
pmax_f = [a[0]]
pmin_f = [a[0]]
for i in range(n):
    pmax_f += [max(pmax_f[-1], a[i])]
    pmin_f += [min(pmin_f[-1], a[i])]

pmax_e = [a[-1]]
pmin_e = [a[-1]]
for i in range(n):
    i = n - i - 1
    
    pmax_e += [max(pmax_e[-1], a[i])]
    pmin_e += [min(pmin_e[-1], a[i])]

ma = 'False'
for i in range(n):
    nat = s * a[i]
    nat += max(pmax_f[i + 1] * q, pmin_f[i + 1] * q)
    i = n - i - 1
    nat += max(pmax_e[i + 1] * r, pmin_e[i + 1] * r)
    if ma == 'False':
        ma = nat
    ma = max(ma, nat)
print(ma)
