#include <bits/stdc++.h>
using namespace std;

#define fill(x,y) memset(x,y,sizeof(x))
#define fi first
#define se second
#define sz(x) ((int) (x).size())
#define all(x) (x).begin(), (x).end()
#define sqr(x) ((x) * (x))
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define pb push_back
#define read(x) scanf("%d",&x)
#define read2(x,y) scanf("%d%d",&x,&y)
#define read3(x,y,z) scanf ("%d%d%d",&x,&y,&z)

typedef long long ll;
typedef string s;
typedef pair<int,int> pii;
typedef pair<int,string> pis;
typedef pair<string,int> psi;
typedef pair<string,string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vector<ll> > matrix;

const ll oo = 1e18;

const double EPS = (1e-7);
int dcmp(double x, double y) {  return fabs(x-y) <= EPS ? 0 : x < y ? -1 : 1; }

void intimain(){
    ios_base::sync_with_stdio(0);
//  freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
}

vector<ll> ne,ps,ls ;

int main(){
   intimain();
   int n ;
   ll a,b,c ;
   cin >> n >> a >> b >> c ;
  ls.pb(a);ls.pb(b);ls.pb(c);
   for(int i=0;i<n;i++){
           ll num ; cin >> num ;
           if(num<0)ne.push_back(num);
           else if (num>0)ps.push_back(num);
           else {ne.push_back(num);ps.push_back(num);}
   }
   sort(all(ne));
   sort(all(ps));
   ll ans = 0 ;
   for(int i=0;i<3;i++){
        if(ls[i]<0){
            if(!ne.empty())ans+=ne[0]*ls[i];
            else ans+=ps[0]*ls[i];
        }
        else if (ls[i]>0){
            if(!ps.empty())ans+=ps.back()*ls[i];
            else ans+=ne.back()*ls[i];
        }
   }
   cout << ans ;
}