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.
/*package whatever //do not write package name here */

import java.io.*;
import java.util.*;

public class codeforces {
	public static void main (String[] args)
	{
	    Scanner in = new Scanner(System.in);
	    
	    int n = in.nextInt();
	    long[] p = new long[3];
	    long[] a = new long[n];
	    long[][] dp = new long[4][n+1];
	    
	    for(int i=0;i<3;i++)
	    	p[i] = in.nextLong();
	    
	    for(int i=0;i<n;i++)
	    	a[i] = in.nextLong();
	    

	    for(int i=0;i<4;i++)
	    	dp[i][0] = Long.MIN_VALUE;
	    
	    for(int j=1;j<4;j++)
	    {
	    	for(int i=1;i<n+1;i++)
	    	{
	    		dp[j][i] = Math.max(dp[j][i-1], p[j-1]*a[i-1] + dp[j-1][i]);
	    	}
	    }
	    
	  /*  for(int i=0;i<4;i++)
	    {
	    	for(int j=0;j<n+1;j++)
	    		System.out.print(dp[i][j]+" ");
	    	System.out.println();
	    }*/
	    System.out.println(dp[3][n]);
	}
}