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

public class Test {

    long p, q, r, ans = Long.MIN_VALUE;
    int[] ns;
    long[] mp, mr;

    int readInt() {
        int ans = 0;
        boolean neg = false;
        try {
            boolean start = false;
            for (int c = 0; (c = System.in.read()) != -1; ) {
                if (c == '-') {
                    start = true;
                    neg = true;
                    continue;
                } else if (c >= '0' && c <= '9') {
                    start = true;
                    ans = ans * 10 + c - '0';
                } else if (start) break;
            }
        } catch (IOException e) {
        }
        return neg ? -ans : ans;
    }

    void start() {
        int n = readInt();
        p = readInt(); q = readInt(); r = readInt();
        mp = new long[n]; mr = new long[n]; ns = new int[n];
        for (int i = 0; i < n; i++) ns[i] = readInt();
        mp[0] = ns[0]*p;
        for (int i = 1; i < n; i++) mp[i] = Math.max(mp[i - 1], p*ns[i]);
        mr[n - 1] = ns[n - 1]*r;
        for (int i = n - 2; i >= 0; i--) mr[i] = Math.max(mr[i + 1], r * ns[i]);
        long ans = Long.MIN_VALUE;
        for (int i = 0; i < n; i++) ans = Math.max(ans, mp[i] + q*ns[i] + mr[i]);
        System.out.println(ans);
    }

    public static void main(String[] args) {
        new Test().start();
    }
}