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.
##a = list(map(int, input().split()))
##print(' '.join(map(str, res)))

[n, p, q, r] = list(map(int, input().split()))
a = list(map(int, input().split()))

Inf = int(1e9+7)
pref_min = [Inf for i in range(n)]
pref_max = [-Inf for i in range(n)]
suf_min = [Inf for i in range(n)]
suf_max = [-Inf for i in range(n)]
pref_min[0] = a[0]
pref_max[0] = a[0]
for i in range(1, n):
    pref_min[i] = min(pref_min[i-1], a[i])
    pref_max[i] = max(pref_max[i-1], a[i])
suf_min[n-1] = a[n-1]
suf_max[n-1] = a[n-1]
for i in range(n-2, -1, -1):
    suf_min[i] = min(suf_min[i+1], a[i])
    suf_max[i] = max(suf_max[i+1], a[i])

res = -int(3e18+7)
for j in range(n):
    x = q*a[j]
    x += max(p*pref_max[j], p*pref_min[j])
    x += max(r*suf_max[j], r*suf_min[j])
    res = max(res, x)
print(res)