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 math import *
from fractions import gcd

def mp():
    return map(int,str(raw_input()).split())
 
mod=10**9+7

n,p,q,r=mp()
l=list(mp())
m1=max(p,q,r)
a=[]
b=[]
c=[]
for i in range(n):
    a+=[l[i]*p]
    b+=[l[i]*q]
    c+=[l[i]*r]
 
a1=[a[0]]
c2=[c[-1]]

for i in range(1,n):
    a1+=[max(a1[i-1],a[i])]
    #b1+=[max(b1[i-1],b[i])]
    #c1+=[max(c1[i-1],c[i])]
    c2+=[max(c2[i-1],c[n-i-1])]
#print a1,b,c2
ans=-1000000000000000000000000
for i in range(n):
    ans=max(ans,b[i]+a1[i]+c2[n-i-1])
#print a,b,c
print ans