#include <bits/stdc++.h>
using namespace std;
const long long int INF = 1e18;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int nax = 1000000 + 10;
long long int n;
pair<int, int> arr[nax];
long long int x, y;
int main() {
  cin >> n;
  cin >> x >> y;
  string s;
  cin >> s;
  n = (int)(s.size());
  string s1 = "";
  s1 += s[0];
  int last = 0;
  for (int i = 1; i < n; i++) {
    if (s[i] == s1[last]) continue;
    s1 += s[i];
    last++;
  }
  s1 += '1';
  last++;
  long long int op = 0;
  for (int i = 0; i <= last - 1; i++) {
    string cur = s1.substr(i, 2);
    if (cur == "01") op++;
  }
  if (!op) {
    cout << 0;
    return 0;
  }
  long long int ans1 = y * op;
  long long int ans2 = (x * op - x) + y;
  cout << min(ans1, ans2);
  return 0;
}
