#include <bits/stdc++.h>
using namespace std;
struct _in {
  const _in operator,(int &a) const {
    a = 0;
    char k = getchar();
    int f = 1;
    while (k > '9' || k < '0') {
      if (k == '-') f = -1;
      k = getchar();
    }
    while (k >= '0' && k <= '9') {
      a = a * 10 + k - '0';
      k = getchar();
    }
    a *= f;
    return *this;
  }
} in;
const int N = 200000 + 5;
char a[N];
int n;
int sum1, sum2, cnt1, cnt2;
int main() {
  in, n;
  scanf("%s", a + 1);
  n /= 2;
  for (int i = 1; i <= n; ++i)
    if (a[i] == '?')
      cnt1++;
    else
      sum1 += a[i] - '0';
  for (int i = n + 1; i <= n * 2; ++i)
    if (a[i] == '?')
      cnt2++;
    else
      sum2 += a[i] - '0';
  if (cnt1 < cnt2) {
    swap(cnt1, cnt2);
    swap(sum1, sum2);
  }
  int tmp = min(sum1, sum2);
  sum1 -= tmp, sum2 -= tmp;
  if ((!sum1) && (!sum2)) {
    printf(cnt1 == cnt2 ? "Bicarp\n" : "Monocarp\n");
    return 0;
  }
  if (cnt1 == cnt2) {
    printf("Monocarp\n");
    return 0;
  }
  if (sum1 > sum2) {
    swap(cnt1, cnt2);
    swap(sum1, sum2);
  }
  tmp = min(cnt1, cnt2);
  cnt1 -= tmp, cnt2 -= tmp;
  if (cnt2) {
    printf("Monocarp\n");
  } else {
    if ((cnt1 / 2) * 9 + sum1 == sum2) {
      printf("Bicarp\n");
    } else {
      printf("Monocarp\n");
    }
  }
  return 0;
}
