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())
arr=[int(i) for i in input().split()]
# leftmax=[arr[0]]
# for i in range(1,len(arr)):
#   leftmax.append(max(leftmax[-1],arr[i]))
# print(leftmax)
# rightmax=[arr[-1]]
# for i in range(len(arr)-2,-1,-1):
#   rightmax.append(max(rightmax[-1],arr[i]))
# rightmax.reverse()
# print(rightmax)
# ans=float('-inf')
# for i in range(1,len(arr)-1):
#   temp=(p*leftmax[i-1])+(q*arr[i])+(r*rightmax[i+1])
#   print(temp)
#   ans=max(ans,temp)
parr=[arr[0]*p]
for i in range(1,len(arr)):
  val=max(arr[i]*p,parr[i-1])
  parr.append(val)
qarr=[arr[0]*q+(p*arr[0])]
for i in range(1,len(arr)):
  val=max(qarr[i-1],(arr[i]*q)+(parr[i]))
  qarr.append(val)
rarr=[(arr[0]*q)+(p*arr[0])+(r*arr[0])]
for i in range(1,len(arr)):
  val=max(rarr[i-1],r*arr[i]+qarr[i])
  rarr.append(val)
print(rarr[-1])