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 python2
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 25 01:33:27 2017

@author: soham
"""

n,p,q,r=raw_input().split()
n=int(n)
p=int(p)
q=int(q)
r=int(r)

arr=map(int,raw_input().split())

ans1=-10000000000000000001
ans2=-10000000000000000001
ans3=-10000000000000000001

arr1=[0]*n
arr2=[0]*n
arr3=[0]*n
suf3=[0]*n
suf2=[0]*n

for i in range(n-1,-1,-1):
    val1=p*arr[i]
    val2=q*arr[i]
    val3=r*arr[i]
    if val3>ans3:
        ans3=val3
    
    arr1[i]=val1
    arr2[i]=val2
    arr3[i]=val3
    suf3[i]=ans3


pos=n-1
f2=arr2[n-1]
f3=suf3[n-1]
ans2=f2+f3

for i in range(n-1,-1,-1):
    val=arr2[i]+suf3[i]
    if ans2<val:
        ans2=val
    suf2[i]=ans2

ans=suf2[n-1]+arr1[n-1]

for i in range(n-1,-1,-1):
    val=arr1[i]+suf2[i]
    if ans<val:
        ans=val
        

print ans