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.
import java.util.List;
import java.util.Arrays;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.BufferedReader;

public final class ProblemB
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader bi = new BufferedReader(new InputStreamReader(System.in));

        long[] arr1 = new long[4];
        String[] strNums1;
        String[] strNums2;

        strNums1 = bi.readLine().trim().split(" +");
        for(int i=0; i<4; i++) {
            arr1[i] = Long.parseLong(strNums1[i]);
        }

        Long[] arr2 = new Long[(int)arr1[0]];

        strNums2 = bi.readLine().trim().split(" +");
        
        for(int i=0; i<arr1[0]; i++) {
            arr2[i] = Long.parseLong(strNums2[i]);
        }

        if(arr1[0] == 0)
        {
            System.out.println(0);
            return;
        }

        if(arr1[0] == 1)
        {
            System.out.println((arr1[1] + arr1[2] + arr1[3])*arr2[0]);
            return;
        }

        long[] arrP = new long[arr2.length];

        arrP[0] = arr2[0]*arr1[1];
        for(int i=1; i<arr2.length; i++)
        {
            arrP[i] = Math.max(arrP[i-1],arr1[1]*arr2[i]);
        }

        Long answer = Long.MIN_VALUE;
        Long loopConstant = Long.MIN_VALUE;

        for(int i=arr2.length-1; i>=0; i--)
        {
            if(arr2[i]*arr1[3] <= loopConstant) continue;
            loopConstant = arr2[i]*arr1[3];
            Long temp = arr2[i]*arr1[2];
            answer = Math.max(answer, arrP[i] + temp + loopConstant);

            for(int j=i-1; j>=0; j--)
            {
                temp = Math.max(temp,arr1[2]*arr2[j]);
                answer = Math.max(answer, arrP[j] + temp + loopConstant);
                //System.out.println("loopConstant: "+loopConstant+" Temp: "+temp+" Answer: "+answer);
            }
        }

        System.out.println(answer);
    }
}