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.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;

import javax.sound.midi.Synthesizer;

public class B {
	public static void main(String[] args) {
		FastScannerB sc = new FastScannerB(System.in);
		
		int N = sc.nextInt();
		long p = sc.nextInt();
		long q = sc.nextInt();
		long r = sc.nextInt();
		
		long[] arr = new long[N];
		for(int i = 0; i<N; i++){
			arr[i] = sc.nextLong();
		}
		
		long[] left = new long[N];
		long[] right = new long[N];
		long max = Long.MIN_VALUE;
		for(int i = 0; i<N; i++){
			long val = arr[i] * p;
			left[i] = Math.max(val, max);
			max = left[i];
		}
		max = Long.MIN_VALUE;
		for(int i = N-1; i>=0; i--){
			long val = arr[i] * r;
			right[i] = Math.max(val, max);
			max = right[i];
		}
		
		max = Long.MIN_VALUE;
		for(int i = 0; i<N; i++){
			long val = left[i] + arr[i] * q + right[i];
//			System.out.println(left[i]);
//			System.out.println(p);
//			System.out.println(arr[i]);
//			System.out.println(q);
//			System.out.println(right[i]);
//			System.out.println(r);
//			System.out.println(val);
			max = Math.max(val, max);
		}
		
//		for(long i : left) System.out.print(i + " ");
//		System.out.println();
//		for(long i : right) System.out.print(i + " ");
		
		System.out.println(max);
		
//		for(int i = 0; i<n; i++){
//			long a = sc.nextInt();
//			min = Math.min(a, min);
//			max = Math.max(a, max);
//		}
//		
//		long sum = 0;
//		if(p < 0) sum += p * min;
//		else sum += p * max;
//		
//		if(q < 0) sum += q * min;
//		else sum += q * max;
//		
//		if(r < 0) sum += r * min;
//		else sum += r * max;
//		
//		System.out.println(sum);
	}
}

class FastScannerB{
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private SpaceCharFilter filter;

    public FastScannerB(InputStream stream)
    {
        this.stream = stream;
    }

    public int read()
    {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars)
        {
            curChar = 0;
            try
            {
                numChars = stream.read(buf);
            } catch (IOException e)
            {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public int nextInt()
    {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-')
        {
            sgn = -1;
            c = read();
        }
        int res = 0;
        do
        {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public String next()
    {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do
        {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }  

    public double nextDouble() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        double res = 0;
        while (!isSpaceChar(c) && c != '.') {
            if (c == 'e' || c == 'E')
                return res * Math.pow(10, nextInt());
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        }
        if (c == '.') {
            c = read();
            double m = 1;
            while (!isSpaceChar(c)) {
                if (c == 'e' || c == 'E')
                    return res * Math.pow(10, nextInt());
                if (c < '0' || c > '9')
                    throw new InputMismatchException();
                m /= 10;
                res += (c - '0') * m;
                c = read();
            }
        }
        return res * sgn;
    }
    
    public long nextLong() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }
    
    public boolean isSpaceChar(int c)
    {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }
    
    public boolean isLineEndChar(int c)
    {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == '\n' || c == '\r' || c == -1;
    }

    public interface SpaceCharFilter
    {
        public boolean isSpaceChar(int ch);
    }
}