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.
# stdin = open("testdata.txt")

# def input():
# 	return stdin.readline().strip()

n, p, q, r = map(int, input().split())
arr = list(map(int, input().split()))

def select_and_multiply(x, arr):
	if x >= 0:
		return x*arr[-1]
	return x*arr[0]

def solve():
	minFromLeft = [None for i in range(n)]
	maxFromLeft = [None for i in range(n)]
	minFromRight = [None for i in range(n)]
	maxFromRight = [None for i in range(n)]
	minFromLeft[0] = arr[0]
	maxFromLeft[0] = arr[0]
	minFromRight[-1] = arr[-1]
	maxFromRight[-1] = arr[-1]

	for i in range(1, n):
		minFromLeft[i] = min(minFromLeft[i-1], arr[i])
		maxFromLeft[i] = max(maxFromLeft[i-1], arr[i])

	for i in range(n-2, -1, -1):
		minFromRight[i] = min(minFromRight[i+1], arr[i])
		maxFromRight[i] = max(maxFromRight[i+1], arr[i])

	result = float('-inf')
	for i in range(n):
		a = maxFromLeft[i] if p >= 0 else minFromLeft[i]
		b = arr[i]
		c = maxFromRight[i] if r >= 0 else minFromRight[i]
		result = max(result, a*p + b*q + c*r)
	return result


print(solve())