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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author OmarYasser
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        TaskB solver = new TaskB();
        solver.solve(1, in, out);
        out.close();
    }

    static class TaskB {
        public void solve(int testNumber, Scanner sc, PrintWriter out) {
            int n = sc.nextInt();
            long p = sc.nextLong(), q = sc.nextLong(), r = sc.nextLong();
            int biggestPos[] = new int[n], biggestNeg[] = new int[n];
            boolean zeroAfter[] = new boolean[n];
            int[] a = new int[n];
            for (int i = 0; i < n; i++)
                a[i] = sc.nextInt();
            biggestPos[n - 1] = a[n - 1];
            biggestNeg[n - 1] = a[n - 1];
            zeroAfter[n - 1] = a[n - 1] == 0;
            for (int i = n - 2; i >= 0; i--) {
                zeroAfter[i] = a[i] == 0 || zeroAfter[i + 1];
                biggestNeg[i] = biggestNeg[i + 1];
                biggestPos[i] = biggestPos[i + 1];


                biggestPos[i] = Math.max(biggestPos[i], a[i]);
                biggestNeg[i] = Math.min(biggestNeg[i], a[i]);
            }

            long bestQR[] = new long[n];
            bestQR[n - 1] = q * a[n - 1] + r * a[n - 1];
            for (int i = n - 2; i >= 0; i--) {
                bestQR[i] = q * a[i];
                if (r >= 0) {
                    bestQR[i] += r * biggestPos[i];
                } else {
                    bestQR[i] += r * biggestNeg[i];
                }
            }
            for (int i = n - 2; i >= 0; i--)
                bestQR[i] = Math.max(bestQR[i], bestQR[i + 1]);
            long max = p * a[0] + q * a[0] + r * a[0];
            for (int i = 0; i < n; i++) {
                long here = p * a[i] + bestQR[i];
                max = Math.max(max, here);
            }
            out.println(max);
        }

    }

    static class Scanner {
        StringTokenizer st;
        BufferedReader br;

        public Scanner(InputStream s) {
            br = new BufferedReader(new InputStreamReader(s));
        }

        public Scanner(FileReader f) {
            br = new BufferedReader(f);
        }

        public String next() {
            while (st == null || !st.hasMoreTokens())
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (Exception e) {
                }
            return st.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}

