#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, tot = 0;
char s[N];
vector<int> a;
bool TRY(int mask) {
  vector<int> v = a;
  int cnt = 0;
  int l = 0, r = 0;
  if (mask & (1 << 1)) r = 1;
  if (mask & (1 << 0)) l = 1;
  for (int i = 0; i < n; i++) {
    if (cnt == tot) break;
    if (v[i] == -1) {
      cnt++;
      if (i >= n / 2)
        v[i] = r * 9;
      else
        v[i] = l * 9;
    }
  }
  l = r = 0;
  int lsum = 0, rsum = 0;
  for (int i = 0; i < n / 2; i++) {
    l += (v[i] == -1);
    if (v[i] != -1) lsum += v[i];
  }
  for (int i = n / 2; i < n; i++) {
    r += (v[i] == -1);
    if (v[i] != -1) rsum += v[i];
  }
  if (lsum > rsum) {
    swap(lsum, rsum);
    swap(l, r);
  }
  int diff = rsum - lsum;
  if (l * 9 >= diff) return 1;
  return 0;
}
int main() {
  cin >> n;
  scanf("%s", s);
  for (int i = 0; i < n; i++) {
    if (s[i] == '?') {
      a.push_back(-1);
      tot++;
    } else
      a.push_back(s[i] - '0');
  }
  tot /= 2;
  bool ans = true;
  for (int i = 0; i < 3; i++) ans &= TRY(i);
  reverse(a.begin(), a.end());
  for (int i = 0; i < 3; i++) ans &= TRY(i);
  if (ans)
    printf("Bicarp\n");
  else
    printf("Monocarp\n");
}
