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.math.BigInteger;
import java.util.Scanner;

/**
 * Created by shaolin on 4/11/16.
 */
public class B {
    static Scanner scanner;

    public static void main(String[] args) {
        scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        BigInteger[] a = new BigInteger[n];
        BigInteger[] maxI = new BigInteger[n];
        BigInteger[] maxJ = new BigInteger[n];
        BigInteger[] maxK = new BigInteger[n];
        BigInteger[] maxSumsIJ = new BigInteger[n];

        BigInteger[] indices = new BigInteger[3];
        indices[0] = BigInteger.valueOf(scanner.nextLong());
        indices[1] = BigInteger.valueOf(scanner.nextLong());
        indices[2] = BigInteger.valueOf(scanner.nextLong());
        a[0] = BigInteger.valueOf(scanner.nextLong());
        maxI[0] = a[0].multiply(indices[0]);

         for (int i = 1; i < n; i++) {
            a[i] = BigInteger.valueOf(scanner.nextLong());
            BigInteger product = a[i].multiply(indices[0]);
            if(product.compareTo(maxI[i-1]) == 1) {
                maxI[i] = product;
            } else {
                maxI[i] = maxI[i-1];
            }
        }

       maxSumsIJ[0] = a[0].multiply(indices[0]);
       maxSumsIJ[0] = maxSumsIJ[0].add(a[0].multiply(indices[1]));

        for (int i = 1; i < n; i++) {
            BigInteger product = a[i].multiply(indices[1]);
            product = product.add(maxI[i]);
            if(product.compareTo(maxSumsIJ[i-1])==1) {
                maxSumsIJ[i] = product;
            } else {
                maxSumsIJ[i] = maxSumsIJ[i-1];
            }
        }

        BigInteger max = a[n-1].multiply(indices[2]);
        max = max.add(maxSumsIJ[n-1]);

        for (int i = n-2; i >=0 ; i--) {
            BigInteger product = a[i].multiply(indices[2]);
            product = product.add(maxSumsIJ[i]);
            if(product.compareTo(max) == 1) {
                max = product;
            }
        }

        System.out.println(max);
    }
}
