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.io.*;
import java.util.*;
import java.math.*;

public class Competitive_1 {
		
	public static void main(String[] args) {
		FastReader in = new FastReader();
		int n=in.nextInt();
		long p=in.nextInt(), q=in.nextInt(), r=in.nextInt();
		long arr[] = new long[n];
		long minSuf[] = new long[n];
		long maxSuf[] = new long[n];
		int minIndexSuf[] = new int[n];
		int maxIndexSuf[] = new int[n];
		long minPre[] = new long[n];
		long maxPre[] = new long[n];
		int minIndexPre[] = new int[n];
		int maxIndexPre[] = new int[n];
		
		for(int i=0; i<n; i++){
			arr[i] = in.nextInt();
		}
		
		long minTempSuf=arr[n-1], maxTempSuf=arr[n-1];
		int iMinSuf=n-1, iMaxSuf=n-1;
		minSuf[n-1] = minTempSuf; maxSuf[n-1] = maxTempSuf;
		minIndexSuf[n-1] = n-1; maxIndexSuf[n-1] = n-1;
		
		for(int i=n-2; i>=0; i--){
			if(arr[i]>=maxTempSuf){
				maxTempSuf = arr[i];
				iMaxSuf = i;
			}
			
			if(arr[i]<=minTempSuf){
				minTempSuf = arr[i];
				iMinSuf = i;
			}
			
			minSuf[i] = minTempSuf;
			maxSuf[i] = maxTempSuf;
			minIndexSuf[i] = iMinSuf;
			maxIndexSuf[i] = iMaxSuf;
		}
		
		long minTempPre=arr[0], maxTempPre=arr[0];
		int iMinPre=0, iMaxPre=0;
		minPre[0] = minTempPre; maxPre[0] = maxTempPre;
		minIndexPre[0] = 0; maxIndexPre[0] = 0;
		
		for(int i=1; i<n; i++){
			if(arr[i]>maxTempPre){
				maxTempPre = arr[i];
				iMaxPre = i;
			}
			
			if(arr[i]<minTempPre){
				minTempPre = arr[i];
				iMinPre = i;
			}
			
			minPre[i] = minTempPre;
			maxPre[i] = maxTempPre;
			minIndexPre[i] = iMinPre;
			maxIndexPre[i] = iMaxPre;
		}
		
		long maxVal = Long.MIN_VALUE;
		
		for(int qq=0; qq<n; qq++){
			int pp = p>=0 ? maxIndexPre[qq] : minIndexPre[qq];
			int rr = r>=0 ? maxIndexSuf[qq] : minIndexSuf[qq];
						
			long temp = p*arr[pp] + q*arr[qq] + r*arr[rr];
			maxVal = Math.max(maxVal, temp);
		}
		
		System.out.println(maxVal);
	}
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	static class FastReader
    {
        BufferedReader br;
        StringTokenizer st;
 
        public FastReader()
        {
            br = new BufferedReader(new
                     InputStreamReader(System.in));
        }
 
        String next()
        {
            while (st == null || !st.hasMoreElements())
            {
                try
                {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e)
                {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        int nextInt()
        {
            return Integer.parseInt(next());
        }
 
        long nextLong()
        {
            return Long.parseLong(next());
        }
 
        double nextDouble()
        {
            return Double.parseDouble(next());
        }
 
        String nextLine()
        {
            String str = "";
            try
            {
                str = br.readLine();
            }
            catch (IOException e)
            {
                e.printStackTrace();
            }
            return str;
        }
    }
	
}