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.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sat Aug 22 14:42:07 2020

@author: yuandali
"""


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

A = list(map(int, input().split()))
    
B = [p, q, r]

#O(N*3)
# n, p, q, r = 5, 1, 2, 3
# B = [1, 2, 3]
# A = [1, 2, 3, 4, 5]

# n, p, q, r = 5, 1, 2, -3
# B = [1, 2, -3]
# A = [-1, -2, -3, -4, -5]
# n, p, q, r = 5, 886327859, 82309257, -68295239
# A = [-731225382, 354766539, -48222231, -474691998, 360965777]
# B = [p, q, r]
def solve():
	dp = [float('-inf')] * n
	dp[0] = B[0] * A[0]
	for i in range(1, n):
		dp[i] = max(B[0]*A[i], dp[i - 1])



	for j in range(1, 3):
		new_dp = [float('-inf')] * n
		new_dp[0] = (A[0]*B[j]) + dp[0]

		for i in range(1, n):
			new_dp[i] = max(new_dp[i - 1], A[i]*B[j] + dp[i])

		dp = new_dp


	return max(dp)



print(solve())