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.
#Lecture3 Maximize the expression ~ Timestamp 1:39
#using prefix and suffix max
import copy

N = input()
N = list(map(int, N.split(' ')))

Arr = input()
Arr = list(map(int, Arr.split(' ')))

p=N[1]
q=N[2]
r=N[3]

prefixmax = [i*p for i in Arr]

suffixmax = [i*r for i in Arr]

#print("prefix max is: ", prefixmax)

for i in range(1, N[0]):
#    print("prefix max is: ", prefixmax)
    if p*Arr[i] > prefixmax[i-1]:
        prefixmax[i] = p*Arr[i]
    else:
        prefixmax[i] = prefixmax[i-1]
    
#print("prefix max is: ", prefixmax)

#print("suffix max is: ", suffixmax)

for i in range(N[0]-2,-1,-1):
#    print("suffix max is: ", suffixmax)
    if r*Arr[i] > suffixmax[i+1]:
        suffixmax[i] = r*Arr[i]
    else:
        suffixmax[i] = suffixmax[i+1]

#print("suffix max is: ", suffixmax)

#print("Arr = : ", Arr)

MAX = list()

for i in range(0,len(Arr)):
#    print(prefixmax[i]+q*Arr[i]+suffixmax[i])
    MAX.append(prefixmax[i]+q*Arr[i]+suffixmax[i])

print(max(MAX))