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.
n,p,q,r=[int(i) for i in raw_input().split()]
l=[int(i) for i in raw_input().split()]
mil=[l[0]]
mal=[l[0]]
for i in range(1,n):
    if l[i]>mal[-1]:
        mal.append(l[i])
    else:
        mal.append(mal[-1])
    if l[i]<mil[-1]:
        mil.append(l[i])
    else:
        mil.append(mil[-1])
if p>=0 and q>=0 and r>=0:
    print mal[-1]*(p+q+r)
elif p<=0 and q<=0 and r<=0:
    print mil[-1]*(p+q+r)
elif p>=0 and q>=0:
    c=l[n-1]
    ans=mal[n-1]*(p+q)+r*l[n-1]
    for i in range(n-2,-1,-1):
        c=min(c,l[i])
        if mal[i]*(p+q)+r*c>ans:
            ans=mal[i]*(p+q)+r*c
    print ans
elif p<=0 and q<=0:
    c=l[n-1]
    ans=mil[n-1]*(p+q)+r*l[n-1]
    for i in range(n-2,-1,-1):
        c=max(c,l[i])
        if mil[i]*(p+q)+r*c>ans:
            ans=mil[i]*(p+q)+r*c
    print ans
elif p>=0 and q<=0 and r<=0:
    c=l[n-1]
    ans=mal[n-1]*(p)+(r+q)*l[n-1]
    for i in range(n-2,-1,-1):
        c=min(c,l[i])
        if mal[i]*(p)+(r+q)*c>ans:
            ans=mal[i]*(p)+(r+q)*c
    print ans
elif p<=0 and q>=0 and r>=0:
    c=l[n-1]
    ans=mil[n-1]*(p)+(r+q)*l[n-1]
    for i in range(n-2,-1,-1):
        c=max(c,l[i])
        if mil[i]*(p)+(r+q)*c>ans:
            ans=mil[i]*(p)+(r+q)*c
    print ans
elif p>=0 and q<=0 and r>=0:
    c=l[n-1]
    ans=mal[n-1]*p+(q+r)*l[n-1]
    for i in range(n-2,-1,-1):
        c=max(c,l[i])
        if mal[i]*p+q*l[i]+r*c>ans:
            ans=mal[i]*p+q*l[i]+r*c
    print ans
else:
    c=l[n-1]
    ans=mil[n-1]*p+(q+r)*l[n-1]
    for i in range(n-2,-1,-1):
        c=min(c,l[i])
        if mil[i]*p+q*l[i]+r*c>ans:
            ans=mil[i]*p+q*l[i]+r*c
    print ans
    
        

    
