#include <bits/stdc++.h>
using namespace std;
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long lcm(long long a, long long b) { return a * (b / gcd(a, b)); }
const int N = 100005;
void solve() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long fval = 0, sval = 0, fq = 0, sq = 0;
  for (long long i = 0; i <= (n / 2) - 1; i++) {
    if (s[i] == '?')
      fq++;
    else
      fval += s[i] - '0';
  }
  for (long long i = n / 2; i <= n - 1; i++) {
    if (s[i] == '?')
      sq++;
    else
      sval += s[i] - '0';
  }
  long long q = fq + sq;
  q /= 2;
  if (fq > sq) {
    fq -= sq;
    if (fval > sval) {
      cout << "Monocarp";
      return;
    } else {
      long long left = fq / 2;
      sval -= fval;
      long long moves = sval / 9 + ((sval % 9) != 0);
      if (left * 9 > sval) {
        cout << "Monocarp";
        return;
      }
      if (moves == left) {
        cout << "Bicarp";
      } else {
        cout << "Monocarp";
      }
    }
  } else {
    swap(fq, sq);
    swap(fval, sval);
    fq -= sq;
    if (fval > sval) {
      cout << "Monocarp";
      return;
    } else {
      long long left = fq / 2;
      sval -= fval;
      long long moves = sval / 9 + ((sval % 9) != 0);
      if (left * 9 > sval) {
        cout << "Monocarp";
        return;
      }
      if (moves == left) {
        cout << "Bicarp";
      } else {
        cout << "Monocarp";
      }
    }
  }
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int TESTS = 1;
  while (TESTS--) {
    solve();
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
