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 sys import stdin,stdout
nmbr=lambda:int(stdin.readline())
lst=lambda:list(map(int,stdin.readline().split()))
for _ in range(1):#nmbr():
    n,p,q,r=lst()
    a=lst()
    NI=float('-inf')
    dp1=[NI]*n
    dp2=[NI]*n
    dp3=[NI]*n
    for i in range(n):
        if i==0:dp1[i]=a[i]*p
        else:dp1[i]=max(dp1[i-1],a[i]*p)
    for i in range(n):
        if i==0:dp2[i]=dp1[i]+a[i]*q
        dp2[i]=max(dp1[i]+q*a[i],dp2[i-1])
    for i in range(n):
        if i==0:dp3[i]=dp2[i]+r*a[0]
        else:dp3[i]=max(dp3[i-1],dp2[i]+a[i]*r)
    # print(dp1)
    # print(dp2)
    # print(dp3)
    print(max(dp3))





