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.
# -------------INPUT---------------------------
n, p, q, r = [int(i) for i in input().split(" ")]
a = input()

b = a.split()

for i in range(n):
    b[i] = int(b[i])

# ---------------------------------------------

dp = [p * b[0]]
for i in range(1, n):
    dp.append(max(dp[i - 1], p * b[i]))
# print(dp)

dq = [dp[0] + q * b[0]]
for i in range(1, n):
    dq.append(max(dq[i - 1], dp[i] + q * b[i]))
# print(dq)

dr = [dq[0] + r * b[0]]
for i in range(1, n):
    dr.append(max(dr[i - 1], dq[i] + r * b[i]))

print(dr[-1])
#  i = 0
# while i < len(a):
#     if a[i] == ' ':
#         i += 1
#     if a[i] == '-':
#         b.append(int(a[i]+a[i+1]))
#         i += 2
#     else:
#         b.append(int(a[i]))
#         i += 1
# print(b)
# num = [p,q,r]
# l = []
# sum = p * b[0] + q * b[0] + r * b[0]
# x = len(b)
# for i in range(x):
#     for j in range(i, x):
#         for k in range(j, x):
#             # print((i,j,k))
#             sum = max(sum, p * b[i] + q * b[j] + r * b[k])
#
# # print(sum)
#
#
# # def indiceb(b):
# #     for i in range(len(b)):
# #         if b[i] == max(b):
#             return i
#
#
# def indices(b):
#     for i in range(len(b)):
#         if b[i] == min(b):
#             return i
#
# if p > 0:
#     sum += max(b) * p
# if p < 0:
#     sum += min(b) * p
#
# if q > 0:
#     sum += max(b[indices(b):]) * q
# if q < 0:
#     sum += min(b) * q
#
# #
# for ii in range(3):
#     if num[ii] >= 0:
#         sum += max(b)*num[ii]
#     if num[ii] < 0:
#         sum += min(b)*num[ii]
