INF = 10**36
def lapjv(mat):
    if len(mat) > len(mat[0]): mat = [*map(list, zip(*mat))]
    n, m = len(mat), len(mat[0]); D = [0]*m; P = [0]*m; mtc = [-1]*n; cm = [-1]*m; C = [*range(m)]; pr = [0]*m; d = 0
    for i in range(n):
        for c in range(m): D[c] = mat[i][c]-P[c]; pr[c] = i
        s = t = x = z = 0
        while z^1:
            if s == t:
                x = s; d = D[C[t]]; t += 1
                for j in range(t, m):
                    if d < D[c:=C[j]]: continue
                    if d > D[c]: d = D[c]; t = s
                    C[j], C[t] = C[t], C[j]; t += 1
                for j in range(s, t):
                    if cm[c:=C[j]] < 0: z = 1; break
                if z: break
            r = cm[e:=C[s]]; s += 1
            for j in range(t, m):
                if D[c:=C[j]] <= (v:=mat[r][c]-mat[r][e]+P[e]-P[c]+d): continue
                D[c] = v; pr[c] = r
                if v == d:
                    if cm[c] < 0: z = 1; break
                    C[j], C[t] = C[t], C[j]; t += 1
            if z: break
        for j in range(x): P[C[j]] += D[C[j]]-d
        r = -1
        while r != i: r = cm[c] = pr[c]; c, mtc[r] = mtc[r], c
    return sum(mat[i][mtc[i]] for i in range(n))
n = int(input())
A, B, C = map(int, input().split())
x = [*map(int, input().split())]
M = [[INF]*n for _ in range(n)]
def f(X, Y):
    b = 0; r = INF
    while max(X, 1)<<b <= Y:
        D = Y-(X<<b); a = 0
        for c in range(b, -1, -1): a += D>>c; D -= (D>>c)<<c
        r = min(r, A*a+B*b); b += 1
    return r
for i in range(n):
    for j in range(n): M[i][j] = C+f(0, x[j]) if i >= j else min(C+f(0, x[j]), f(x[i], x[j]))
print(lapjv(M)-C)