#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const long long INF = 8 * 1e18;
const int big = 1e6 + 7;
long long gcd(long long a, long long b) {
  if (!b) return a;
  return gcd(b, a % b);
}
long long power(long long x, long long y, long long p = mod) {
  long long res = 1;
  x %= p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y >>= 1;
    x = (x * x) % p;
  }
  return res;
}
long long lcm(long long x, long long y) { return ((x * y) / (gcd(x, y))); }
long long modi(long long x) { return power(x, mod - 2); }
void solve() {
  int n;
  cin >> n;
  string a;
  cin >> a;
  int l = 0, r = 0, ql = 0, qr = 0;
  for (int i = 0; i < n / 2; i++)
    if (a[i] == '?')
      ql++;
    else
      l += (a[i] - '0');
  for (int i = n / 2; i < n; i++)
    if (a[i] == '?')
      qr++;
    else
      r += (a[i] - '0');
  if (ql == qr) {
    if (l == r)
      cout << "Bicarp\n";
    else
      cout << "Monocarp\n";
    return;
  }
  if ((ql > qr && l > r) || (ql < qr && l < r)) {
    cout << "Monocarp\n";
    return;
  }
  int q = abs(ql - qr);
  int s = abs(l - r);
  if (s == (q / 2) * 9)
    cout << "Bicarp\n";
  else
    cout << "Monocarp\n";
}
void fastio() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
void preprocessing() { return; }
int main() {
  bool q = 0;
  fastio();
  int t = 1;
  if (q) cin >> t;
  preprocessing();
  while (t--) {
    solve();
  }
}
