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

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

    static class TaskB {
        private int[] arr;
        private long[][] sparseP;
        private long[][] sparseR;
        private int n;
        private int p;
        private int q;
        private int r;

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            n = in.nextInt();
            p = in.nextInt();
            q = in.nextInt();
            r = in.nextInt();
            arr = in.nextIntArray(n);
            sparseP = new long[(int) log2(n) + 1][n];
            sparseR = new long[(int) log2(n) + 1][n];
            buildP();
            buildR();
            long ans = Long.MIN_VALUE;
            for (int i = 0; i < n; i++) {
                long v1 = queryP(0, i), v2 = queryR(i, n - 1);
                ans = Math.max(ans, v1 + (long) arr[i] * q + v2);
            }
            out.println(ans);
        }

        private void buildP() {
            for (int j = 0; j < n; j++) sparseP[0][j] = arr[j] * (long) p;
            for (int i = 1; i < (int) log2(n) + 1; i++) {
                for (int j = 0; j + (1 << i) <= n; j++) {
                    sparseP[i][j] = Math.max(sparseP[i - 1][j], sparseP[i - 1][j + (1 << (i - 1))]);
                }
            }
        }

        private void buildR() {
            for (int j = 0; j < n; j++) sparseR[0][j] = arr[j] * (long) r;
            for (int i = 1; i < (int) log2(n) + 1; i++) {
                for (int j = 0; j + (1 << i) <= n; j++) {
                    sparseR[i][j] = Math.max(sparseR[i - 1][j], sparseR[i - 1][j + (1 << (i - 1))]);
                }
            }
        }

        private long queryP(int l, int r) {
            int k = (int) log2(r - l + 1);
            long max = Long.MIN_VALUE;
            for (int i = k; i >= 0; i--) {
                if (l + (1 << i) - 1 <= r) {
                    max = Math.max(max, sparseP[i][l]);
                    l += (1 << i);
                }
            }
            return max;
        }

        private long queryR(int l, int r) {
            int k = (int) log2(r - l + 1);
            long max = Long.MIN_VALUE;
            for (int i = k; i >= 0; i--) {
                if (l + (1 << i) - 1 <= r) {
                    max = Math.max(max, sparseR[i][l]);
                    l += (1 << i);
                }
            }
            return max;
        }

        private static double log2(double x) {
            return Math.log(x) / Math.log(2);
        }

    }

    static class InputReader {
        private int lenbuf = 0;
        private int ptrbuf = 0;
        private InputStream in;
        private byte[] inbuf = new byte[1024];

        public InputReader(InputStream in) {
            this.in = in;
        }

        private int readByte() {
            if (lenbuf == -1) throw new InputMismatchException();
            if (ptrbuf >= lenbuf) {
                ptrbuf = 0;
                try {
                    lenbuf = in.read(inbuf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (lenbuf <= 0) return -1;
            }
            return inbuf[ptrbuf++];
        }

        public int nextInt() {
            int num = 0, b;
            boolean minus = false;
            while ((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-')) ;
            if (b == '-') {
                minus = true;
                b = readByte();
            }

            while (true) {
                if (b >= '0' && b <= '9') {
                    num = num * 10 + (b - '0');
                } else {
                    return minus ? -num : num;
                }
                b = readByte();
            }
        }

        public int[] nextIntArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

    }
}

