#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
void fun() {}
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
vector<long long> factors(long long n) {
  vector<long long> f;
  for (long long x = 2; x * x <= n; x++) {
    while (n % x == 0) {
      f.push_back(x);
      n /= x;
    }
  }
  if (n > 1) f.push_back(n);
  return f;
}
long long powmod(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) {
      ans = ans * a % mod;
    }
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long inv(long long x) { return powmod(x, mod - 2); }
long long cat(long long n) {
  long long final = 1;
  for (int i = 0; i < n; i++) {
    final = final * (2 * n - i) % mod * inv(1 + i) % mod;
  }
  final = final * inv(1 + n) % mod;
  return final;
}
long long bin(long long x, long long y) {
  if (y == 0) {
    return 1;
  }
  long long u = bin(x, y / 2);
  if (y % 2 == 0) {
    return u * u % mod;
  } else {
    return u * u % mod * x % mod;
  }
}
const int MaxN = 4e5 + 10;
const int MAXN = 120 * 1000;
int cD(long long n) { return floor(log10(n) + 1); }
long long front[MaxN] = {0}, back[MaxN] = {0};
long long last = 1000000000007;
long long x, y, x2, x3, sum = 0, sum2 = 0, i, j, g, t, mid;
long long d1 = 0, d2 = 0;
long long n, k, q, c, r, m;
long long ans, l, f;
long double n1, n2, nc, pc, h, zc, l2, l3, l4;
const int No = 3e5 + 5;
pair<long long, long long> p[No];
long long an, bn, cn, dn;
int main() {
  fun();
  ios_base::sync_with_stdio(false);
  string s;
  cin >> n >> x >> y >> s;
  long long p = 0;
  for (int i = 0; i < s.size(); i++) {
    if (p == 0) {
      if (s[i] == '0') {
        c++;
        p = 1;
      }
    } else if (p == 1) {
      if (s[i] == '1') p = 0;
    }
  }
  ans = min(x * (c - 1) + y, y * c);
  if (c == 0) ans = 0;
  cout << ans;
  return 0;
  return 0;
}
