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.
def maxe(a,b):
    if a>b:
        return a
    elif a<b:
        return b
    else:
        return a
def pmmax(a,p):
    x=0
    a[x]=a[x]*p
    max=a[0]
    y=x+1
    cap=len(a)-1
    while y!=cap+1:
        
        max=maxe(max,p*a[y])
        a[y]=max
        y=y+1
    return a
def smmax(a,r):
    x=len(a)-1
    a[x]=a[x]*r
    max=a[x]
    y=x-1
    while y!=-1:
        max=maxe(max,r*a[y])
        a[y]=max
        y=y-1
    return a
def main():
    
    n,p,q,r= list(map(int,input().strip().split()))[:4]
    a=[]
    a= list(map(int,input().strip().split()))[:n]
    b=list(a)
    b=pmmax(b,p)



    c=list(a)


    c=smmax(c,r)

    start=0
    finish=len(a)-1
    max=(a[0])*p+(a[0])*q+(a[0])*r

    max=maxe(max,((a[finish])*p+(a[finish])*q+(a[finish])*r))



    st=1

    i=0

    while start!=finish:
        max=maxe(max,((a[start])*p+(a[start])*q+(a[start])*r))

        max=maxe(max,(a[start]*p+(a[start])*q+c[start+1]))
        if start!=0:    
            max=maxe(max,(b[start-1]+(a[start])*q+(a[start])*r))
            max=maxe(max,(b[start-1]+(a[start])*q+c[start+1]))
        

        start=start+1

    print(max)
if __name__ == "__main__":
    main()
