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.
from collections import defaultdict
n,p,q,r = map(int, raw_input().split())
l = map(int, raw_input().split())

min1 = defaultdict(int)
min1[0] = l[0]
for i in range (1,n):
    min1[i] = min (min1[i-1], l[i])

max1 = defaultdict(int)
max1[0] = l[0]
for i in range(1,n):
    max1[i] = max(max1[i-1], l[i])

min2 = defaultdict(int)
min2[n-1] = l[n-1]
for i in range (0,n-1):
    min2[n-2-i] = min(min2[n-1-i], l[n-2-i])

max2 = defaultdict(int)
max2[n-1] = l[n-1]
for i in range (0,n-1):
    max2[n-2-i] = max(max2[n-1-i], l[n-2-i])

if p>=0 and r>= 0:
    ans = []
    for i in range (0, n):
        ans.append(p*max1[i] + q*l[i] + r*max2[i])
    print max(ans)
elif p>=0 and r< 0:
    ans = []
    for i in range (0, n):
        ans.append(p*max1[i] + q*l[i] + r*min2[i])
    print max(ans)
elif p<0 and r>= 0:
    ans = []
    for i in range (0, n):
        ans.append(p*min1[i] + q*l[i] + r*max2[i])
    print max(ans)
elif p<0 and r<0:
    ans = []
    for i in range (0, n):
        ans.append(p*min1[i] + q*l[i] + r*min2[i])
    print max(ans)