The current round has unusual rules. Please, read about them in the announcement.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Marvolo Gaunt's Ring

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputProfessor 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*·*a*_{i} + *q*·*a*_{j} + *r*·*a*_{k} for given *p*, *q*, *r* and array *a*_{1}, *a*_{2}, ... *a*_{n} 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* ( - 10^{9} ≤ *p*, *q*, *r* ≤ 10^{9}, 1 ≤ *n* ≤ 10^{5}).

Next line of input contains *n* space separated integers *a*_{1}, *a*_{2}, ... *a*_{n} ( - 10^{9} ≤ *a*_{i} ≤ 10^{9}).

Output

Output a single integer the maximum value of *p*·*a*_{i} + *q*·*a*_{j} + *r*·*a*_{k} 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.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/17/2018 19:32:05 (d3).

Desktop version, switch to mobile version.

User lists

Name |
---|