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.
import sys
n, p, q, r = [int(x) for x in input().split()]
pmax = [] * n
smax = [] * n
#print(type(pmax))
#print(type(smax))
arr = list(map(int, input().split()))[:n]


pmax.append(p * arr[0])
for i in range(1, n):
	pmax.append(max(pmax[i-1], p * arr[i]))

#print(pmax)
smax.append(r * arr[n-1])
#print(smax[0])
for i in range(n-2, -1, -1):
	#print(smax[-1])
	smax.insert(0, max(smax[0], r * arr[i]))

if p == 0 and q == 0 and r == 0:
	print(0)
#print(smax)
#print(ans)
else:
	ans = pmax[0] + q * arr[0] + smax[0]	
	i = 1
	while i < n:
		ans = max(ans, pmax[i] + q * arr[i] + smax[i])
		i += 1
	print(ans)

