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 main():
	n, p, q, r  = [ int(i) for i in input().split() ] 
	L = [ int(i) for i in input().split() ]
	
	
	LR_big = [L[0]]
	LR_small = [L[0]]
	for i in range(1,len(L)):
		LR_big.append( max(L[i], LR_big[-1]) )
		LR_small.append( min(L[i], LR_small[-1]) )
		
	RL_big = [L[-1]]
	RL_small = [L[-1]]
	for i in range( len(L)-2, -1, -1):
		RL_big.append( max(L[i], RL_big[-1] ))
		RL_small.append( min(L[i], RL_small[-1] ))
	
	RL_big = RL_big[::-1]
	RL_small = RL_small[::-1]
	
	"""	
	print(LR_big)
	print(LR_small)
	print(RL_big)
	print(RL_small)
	"""
	
	count = -10**20
	for i in range(len(L)):
		
		count = max(max(LR_small[i]*p, LR_big[i]*p) + L[i]*q + max(RL_small[i]*r, RL_big[i]*r), count)
	
	print(count)
	
main()