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.
inp = input().split()
n = int(inp[0])
p = int(inp[1])
q = int(inp[2])
r = int(inp[3])
del inp
del n
a = input().split()

mas_1 = list()
mas_2 = list()
mas_3 = list()
max = int(a[0]) * p
for i in a:
    if int(i)*p> max:
        max = int(i)*p
    mas_1.append(max)

max = mas_1[0] + int(a[0])*q
for i in range(len(a)):
    if mas_1[i] + int(a[i])*q > max:
        max = mas_1[i] + int(a[i])*q
    mas_2.append(max)

max = mas_2[0] + int(a[0])*r
for i in range(len(a)):
    if mas_2[i] + int(a[i])*r>max:
        max = mas_2[i] + int(a[i])*r
    mas_3.append(max)


#print(mas_1)
#print(mas_2)
#print(mas_3)
print(mas_3[len(mas_3)-1])
