#include <bits/stdc++.h>
using namespace std;
long double eps = (long double)1 / 1e6;
long long inf = INT_MAX, mod2 = 998244353, mod1 = 1e9 + 7;
long long sqr(long long a) { return a * a; }
long long qb(long long a) { return a * a * a; }
long long gcd(long long a, long long b) { return !a ? b : gcd(b % a, a); }
long long binpow(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (a * (sqr(binpow(a, b / 2, mod)) % mod)) % mod
                    : sqr(binpow(a, b / 2, mod)) % mod)
           : 1;
}
long long binmult(long long a, long long b, long long mod) {
  return b ? (b % 2 ? (2 * binmult(a, b / 2, mod) + a) % mod
                    : (2 * binmult(a, b / 2, mod)) % mod)
           : 0;
}
const long long R = 1e4;
const long long tx[4] = {0, 0, -1, 1};
const long long ty[4] = {-1, 1, 0, 0};
const char rev_to[4] = {'E', 'W', 'N', 'S'};
const long long N = 2 * 1e5 + 4;
set<int> ab;
set<int> ba;
signed main() {
  cin.tie(0);
  cout.tie(0);
  ios_base::sync_with_stdio(0);
  ;
  long long n;
  cin >> n;
  vector<char> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long sum1 = 0, sum2 = 0;
  long long first = 0, second = 0;
  for (int i = 0; i < n; i++) {
    if (a[i] == '?') {
      if (i < n / 2)
        first++;
      else
        second++;
    } else {
      if (i < n / 2)
        sum1 += a[i] - '0';
      else
        sum2 += a[i] - '0';
    }
  }
  if (sum1 < sum2) {
    swap(sum1, sum2);
    swap(first, second);
  }
  if (sum1 >= sum2) {
    if (sum1 + (first / 2) * 9 - sum2 - ceil(second / 2) * 9 <= 0 &&
        sum1 + (first / 2) * 9 - sum2 - ceil(second / 2) * 9 >= 0) {
      cout << "Bicarp";
    } else {
      cout << "Monocarp";
    }
  }
  return 0;
}
