#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f3f3f3f;
const int T = 3e5 + 10;
string s;
bool vis[T];
int n;
void dfs(int u) {
  vis[u] = true;
  if (u - 1 >= 0 and s[u - 1] == '0' and !vis[u - 1]) dfs(u - 1);
  if (u + 1 < n and s[u + 1] == '0' and !vis[u + 1]) dfs(u + 1);
}
int main() {
  ios::sync_with_stdio(false);
  long long x, y;
  cin >> n >> x >> y;
  cin >> s;
  long long comps = 0;
  for (int i = 0; i < s.size(); i++)
    if (!vis[i] and s[i] == '0') comps++, dfs(i);
  long long ans = y * comps;
  for (int i = comps; i > 0; i--) {
    long long tmp = i * y + (comps - i) * x;
    ans = min(ans, tmp);
  }
  cout << ans << endl;
  return 0;
}
