#include <bits/stdc++.h>
using namespace std;
long long int min(long long int a, long long int b) {
  if (a < b) return a;
  return b;
}
long long int max(long long int a, long long int b) {
  if (a > b) return a;
  return b;
}
long long int gcd(long long int a, long long int b) {
  if (a == 0 || b == 0) return (a + b);
  if (a < b) swap(a, b);
  return gcd(b, a % b);
}
int main() {
  int n, left = 0, right = 0, lblank = 0, rblank = 0;
  cin >> n;
  string s;
  cin >> s;
  for (int i = 0; i < n; i++) {
    if (i < n / 2) {
      if (s[i] == '?')
        lblank++;
      else {
        left += (int)s[i] - (int)'0';
      }
    } else {
      if (s[i] == '?')
        rblank++;
      else
        right += (int)s[i] - (int)'0';
    }
  }
  bool mono = false;
  int m, b, m1, b1;
  b = lblank / 2;
  m = (lblank + 1) / 2;
  if (lblank % 2 == 1) {
    b1 = (rblank + 1) / 2;
    m1 = (rblank) / 2;
  } else {
    b1 = (rblank) / 2;
    m1 = (rblank) / 2;
  }
  int templeft = left + m * 9;
  int tempright = right + 9 * b1;
  if (templeft != tempright) mono = true;
  templeft = left + b * 9;
  tempright = right + m1 * 9;
  if (templeft != tempright) mono = true;
  b = rblank / 2;
  m = (rblank + 1) / 2;
  if (rblank % 2 == 1) {
    b1 = (lblank + 1) / 2;
    m1 = (lblank) / 2;
  } else {
    b1 = (lblank) / 2;
    m1 = (lblank) / 2;
  }
  tempright = right + 9 * m;
  templeft = left + 9 * b1;
  if (templeft != tempright) mono = true;
  tempright = right + 9 * b;
  templeft = left + 9 * m1;
  if (templeft != tempright) mono = true;
  if (mono)
    cout << "Monocarp";
  else
    cout << "Bicarp";
}
