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;

import static java.math.BigInteger.*;

public class Codeforces855BSolver {

    public BigInteger solve(int n, int p, int q, int r, int[] a) {

        BigInteger[] pMaxes = new BigInteger[n];
        BigInteger[] pqMaxes = new BigInteger[n];
        BigInteger[] pqrMaxes = new BigInteger[n];

        pMaxes[0] = valueOf(p).multiply(valueOf(a[0]));
        for (int i = 1; i < n; i++) {
            BigInteger currentValue = valueOf(p).multiply(valueOf(a[i]));
            pMaxes[i] = max(pMaxes[i - 1], currentValue);
        }

        pqMaxes[0] = pMaxes[0].add(valueOf(q).multiply(valueOf(a[0])));
        for (int i = 1; i < n; i++) {
            BigInteger currentValue = pMaxes[i].add(valueOf(q).multiply(valueOf(a[i])));
            pqMaxes[i] = max(pqMaxes[i - 1], currentValue);
        }

        pqrMaxes[0] = pqMaxes[0].add(valueOf(r).multiply(valueOf(a[0])));
        for (int i = 1; i < n; i++) {
            BigInteger currentValue = pqMaxes[i].add(valueOf(r).multiply(valueOf(a[i])));
            pqrMaxes[i] = max(pqrMaxes[i - 1], currentValue);
        }

        return pqrMaxes[pqrMaxes.length - 1];
    }

    private BigInteger max(BigInteger a, BigInteger b) {
        return a.compareTo(b) > 0 ? a : b;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        int p = scanner.nextInt();
        int q = scanner.nextInt();
        int r = scanner.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < a.length; i++) {
            a[i] = scanner.nextInt();
        }

        Codeforces855BSolver codeforces855BSolver = new Codeforces855BSolver();

        BigInteger result = codeforces855BSolver.solve(n, p, q, r, a);
        System.out.println(result);
    }
}
