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/python3
# -*- coding: UTF-8 -*-
 
 
# Função que lê uma quantidade qualquer de inteiros em uma só linha
read_int = lambda string: list(map(int, string.split()))
 
# x[i] = valor máximo de k*arr, considerando os elementos de arr apenas de 0 até i; i.e, x[i] = (arr_0, arr_1, ..., arr_i <= arr_n)
# v[i] = o x[i] acumulado dos cálculos anteriores
def max_until_i(k, arr, v):
    x = [None] * len(arr)
 
    x[0] = k*arr[0] + v[0]
    for i in range(1, len(arr)):
        x[i] = max(x[i - 1], k*arr[i] + v[i])
 
    return x
 
# Função principal
def main():
    n, p, q, r = read_int(input())
    arr = read_int(input()) # len(arr) = n (garantido pelo juiz online)
 
    x = max_until_i(p, arr, [0] * len(arr))
    y = max_until_i(q, arr, x)
    z = max_until_i(r, arr, y)
 
    print(z[-1])
 
 
if __name__ == '__main__':
    main()
