#include <bits/stdc++.h>
using namespace std;
const int N=1e4+5;
int a[N];
inline int lowbit(int x)
{
	return x&-x;
}
int main()
{
	int n;
	cin>>n;
	int c1,c2;
	cin>>c1>>c2;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		f[i]=i;
	}
	sort(a+1,a+n+1);
	if(c1==c2)
	{
		cout<<(n-1)*c1<<endl;
		return 0;
	}
	if(c1<c2)
	{
		int cnt=0;
		for(int i=1;i<n;i++)
		{
			if(a[i]%2==0 && a[i]^a[i+1]==1)
			{
				cnt++;
			}
		}
		cout<<(n-cnt-1)*c2+cnt*c1<<endl;
		return 0;
	}
	if(c1>c2)
	{
		cout<<(n-1)*c2<<endl;
	}
    return 0;
}