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.
class CodeforcesTask855BSolution:
    def __init__(self):
        self.result = ''
        self.n_p_q_r = []
        self.a = []

    def read_input(self):
        self.n_p_q_r = [int(x) for x in input().split(" ")]
        self.a = [int(x) for x in input().split(" ")]

    def process_task(self):
        dp = [[0] * self.n_p_q_r[0] for x in range(3)]
        for x in range(3):
            dp[x][0] = self.a[0] * self.n_p_q_r[1 + x]
            if x > 0:
                dp[x][0] += dp[x - 1][0]
            for y in range(1, self.n_p_q_r[0]):
                if not x:
                    dp[x][y] = max(dp[x][y - 1], self.a[y] * self.n_p_q_r[1 + x])
                else:
                    dp[x][y] = max(dp[x][y - 1], self.a[y] * self.n_p_q_r[1 + x] + dp[x - 1][y])
        self.result = str(dp[2][-1])

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask855BSolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
