#include <stdio.h>
#include <iostream>
#include <vector>
#include <queue>
#include <stack>
#include <algorithm>

#pragma GCC optimize("O2")

using ll = long long int;
const int INF = (1<<30);
const ll INFLL = (1ll<<60);
const ll MOD = (ll)(1e9+7);

#define l_ength size

void mul_mod(ll& a, ll b){
	a *= b;
	a %= MOD;
}

void add_mod(ll& a, ll b){
	a = (a<MOD)?a:(a-MOD);
	b = (b<MOD)?b:(b-MOD);
	a += b;
	a = (a<MOD)?a:(a-MOD);
}

ll dp[225816][2],a[225816];;

int main(void){
	int n,i,j,k;
	ll x,y;
	std::fill(dp[0],dp[225816],INFLL);
	dp[0][0] = 0ll;
	std::cin >> n >> y >> x;
	for(i=0; i<n; ++i){
		std::cin >> a[i];
		for(j=0; j<2; ++j){
			for(k=0; k<2; ++k){
				dp[i+1][k] = std::min(dp[i+1][k],dp[i][j]+a[i]*(1-k)+y*k+x*((1-j)&k));
			}
		}
	}
	std::cout << (std::min(dp[n][0],dp[n][1])) << std::endl;
	return 0;
}