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.
//package com.company;
import java.util.*;

import java.io.*;
public class Main{
    static final int maxn=(int)1e5+10;
    static long[][] val=new long[5][maxn];
    public static void main(String[] args){
        Scanner in=new Scanner(System.in);
        int N=in.nextInt();

        long[] v=new long[5];
        for(int i=0;i<3;i++){
            v[i]=in.nextLong();
        }
        for(int i=1;i<=N;i++){
            val[0][i]=in.nextLong();
        }


        long mt=-0x3f3f3f3f3f3f3f3fL;
        for(int i=1;i<=N;i++){
            mt=Math.max(mt,v[0]*val[0][i]);
            val[1][i]=mt;
        }
        mt=-0x3f3f3f3f3f3f3f3fL;
        for(int i=1;i<=N;i++){
            mt=Math.max(mt,v[1]*val[0][i]+val[1][i]);
            val[2][i]=mt;
        }
        mt=-0x3f3f3f3f3f3f3f3fL;
        for(int i=1;i<=N;i++){
            mt=Math.max(mt,v[2]*val[0][i]+val[2][i]);
        }
        System.out.println(mt);
    }
}