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=map(int,input().split())
a=list(map(int,input().split()))
b=a[::-1]
ma=[0]*n
mb=[0]*n
Ma=[0]*n
Mb=[0]*n
ma[0]=Ma[0]=a[0]
mb[0]=Mb[0]=b[0]
for i in range(1,n):
  ma[i]=min(ma[i-1],a[i])
  mb[i]=min(mb[i-1],b[i])
  Ma[i]=max(Ma[i-1],a[i])
  Mb[i]=max(Mb[i-1],b[i])
ans=(p+q+r)*a[0]
for j in range(n):
  z=max(ma[j]*p,Ma[j]*p)+q*a[j]+max(mb[n-1-j]*r,Mb[n-1-j]*r)
  ans=max(ans,z)
print(ans)