You are given an array of integers A of size N and 3 integers l, m, n. Your task is to find the maximum value of the given function: $f(i, j, k) = l * {A_i} + m * {A_j} + n *{ A_k} \quad : \quad 1 \leq i \leq j \leq k \leq N$

Input

First line contains 4 integers $N, l, m$ and n

Second line contains N space separated integers ${A_1}, {A_2}, . . . , {A_n}$

Output

A single integer denoting the maximum value of the function

Constraints

$1 \leq N \leq 10^5$

$-10^9 \leq l, m, n \leq 10^9$

$-10^9 \leq {A_i} \leq 10^9 \quad \forall \quad 1 \leq i \leq N$